4 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.DM2020
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…
math.CO2012★ 4 cited
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 $…