Author

Fei-Huang Chang

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

Every 2-Subdivision of a Cubic Graph Is Antimagic

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 antimagic labelings of repeated subdivisions, but the cubic case G(3) = S_2(G) is not covered by those methods. Our first proof constructs an ed...

Fei-Huang Chang, Teng-Da Chang, Zhishi Pan · 0 citations

Preprint Sep 2026

List-distance consistent vertices in trees are confined to a path

A labeling of a connected graph $G$ on $n$ vertices is a bijection $c:V(G)\to\{1,\dots,n\}$; writing $c(u,v)=|c(u)-c(v)|$, a vertex $u$ is list-distance consistent if $d(u,v)<d(u,w)$ implies $c(u,v)\le c(u,w)$ for all $v,w$. The maximum number of such vertices over all labelings is the list-distance consistency ldc$(G)...

Fei-Huang Chang, Ma-Lian Chia, David Kuo et al. · 0 citations