Login / Signup

Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles.

Qiaojun ShuYong ChenShuguang HanGuohui LinEiji MiyanoAn 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