Fei-Huang Chang

activity

20132026

most citedThe Strongly Antimagic labelings of Double Spiders

7 citations · 12 across the 9 of their papers we have counts for

collaborators

Showing math.COShow all

8 papers · 1 filter

math.CO2026

Grundy Total Domination and Skew Zero Forcing in Cartesian Products of Paths and Cycles

Fei-Huang Chang

We determine the Grundy total domination number and the skew zero forcing number for every Cartesian product of two paths or cycles, thereby closing the nonmatching bounds previous…

math.CO2026

Every 2-Subdivision of a Cubic Graph Is Antimagic

Fei-Huang Chang, Teng-Da Chang, Zhishi Pan

Let G be a finite simple cubic graph, not necessarily connected, and let S_2(G) be obtained by subdividing every edge of G twice. Li (2025) developed general constructions for anti…

math.CO2018★ 5 cited

Rainbow Ramsey problems for the Boolean lattice

Fei-Huang Chang, Dániel Gerbner, Wei-Tian Li +4

We address the following rainbow Ramsey problem: For posets $P, Q$ what is the smallest number $n$ such that any coloring of the elements of the Boolean lattice $B_{n}$ either admits…

math.CO2018

Shifted-antimagic Labelings for Graphs

Fei-Huang Chang, Hong-Bin Chen, Wei-Tian Li +1

The concept of antimagic labelings of a graph is to produce distinct vertex sums by labeling edges through consecutive numbers starting from one. A long-standing conjecture is that…

math.CO2017★ 7 cited

The Strongly Antimagic labelings of Double Spiders

Fei-Huang Chang, Pinhui Chin, Wei-Tian Li +1

A graph $G = (V, E)$ is strongly antimagic, if there is a bijective mapping $f : E \to {1, 2, \dots, ∣ E ∣}$ such that for any two vertices $u \neq = v$ , not only $\sum_{e \in E(u)}f(e) \ne…

math.CO2016

Families of Subsets Without a Given Poset in the Interval Chains

Jun-Yi Guo, Fei-Huang Chang, Hong-Bin Chen +1

For two posets $P$ and $Q$ , we say $Q$ is $P$ -free if there does not exist any order-preserving injection from $P$ to $Q$ . The speical case for $Q$ being the Boolean lattice $B_{n}$ …

math.CO2015

Anti-magic labeling of regular graphs

Feihuang Chang, Yu-Chang Liang, Zhishi Pan +1

A graph $G = (V, E)$ is antimagic if there is a one-to-one correspondence $f : E \to {1, 2, \dots, ∣ E ∣}$ such that for any two vertices $u, v$ , $\sum_{e \in E(u)}f(e) \ne \sum_{e\in E(…

math.CO2013

On-Line Choice Number of Complete Multipartite Graphs: an Algorithmic Approach

Fei-Huang Chang, Hong-Bin Chen, Jun-Yi Guo +1

This paper studies the on-line choice number on complete multipartite graphs with independence number $m$ . We give a unified strategy for every prescribed $m$ . Our main result lead…