Login / Signup
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles.
Qiaojun Shu
Guohui Lin
Eiji Miyano
Published in:
CoRR (2020)
Keyphrases
</>
planar graphs
weighted graph
undirected graph
edge detection
edge information
np hard
edge detector
minimum weight
lower bound
spanning tree
computational complexity
upper bound
shortest path
edge map
edge weights