4 citations · 4 across the 5 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2023
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…
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…