Planar graphs without cycles of length 4 or 7 are (2, 0, 0)-colorable

DOI10.1360/012014-50zbMath1488.05139OpenAlexW2327889826MaRDI QIDQ5017899

Ying Qian Wang, Pei-Pei Liu

Publication date: 17 December 2021

Published in: SCIENTIA SINICA Mathematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1360/012014-50

zbMATH Keywords

cycleplanar graphimproper coloring

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable ⋮ Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable

This page was built for publication: Planar graphs without cycles of length 4 or 7 are (2, 0, 0)-colorable