Login / Signup
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles.
Qiaojun Shu
Yong Chen
Shuguang Han
Guohui Lin
Eiji Miyano
An Zhang
Published in:
Theor. Comput. Sci. (2021)
Keyphrases
</>
planar graphs
weighted graph
undirected graph
edge detection
minimum weight
np complete
edge information
np hard
pairwise
special case
em algorithm
graph structure
boundary points