4 citations · 4 across the 5 of their papers we have counts for
5 papers
Planar graphs are acyclically edge -colorable
Qiaojun Shu, Guohui Lin
An edge coloring of a graph is to color all the edges in the graph such that adjacent edges receive different colors. It is acyclic if each cycle in the graph receives at least…
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
Qiaojun Shu, Guohui Lin, Eiji Miyano
An acyclic edge coloring of a graph is a proper edge coloring such that no bichromatic cycles are produced. The acyclic edge coloring conjecture by Fiam{č}ik (1978) and Alon, S…
A characterization of L(2, 1)-labeling number for trees with maximum degree 3
Dong Chen, Wai Chee Shiu, Qiaojun Shu +2
An L(2, 1)-labeling of a graph is an assignment of nonnegative integers to the vertices of G such that adjacent vertices receive numbers differed by at least 2, and vertices at dis…
Every 4-regular graph is acyclically edge-6-colorable
Wang Weifan, Shu Qiaojun, Wang Yiqiao
An acyclic edge coloring of a graph is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index of is the smallest integer $…
A new upper bound on the acyclic chromatic indices of planar graphs
Weifan Wang, Qiaojun Shu, Yiqiao Wang
An acyclic edge coloring of a graph is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index of is the smallest integer $…