Login / Signup

Planar graphs without 4-cycles and intersecting triangles are (1, 1, 0)-colorable.

Xiangwen LiRunrun LiuGexin Yu
Published in: Discret. Appl. Math. (2021)
Keyphrases
  • planar graphs
  • minimum weight
  • bipartite graph
  • graph cuts