Improper colorability of planar graphs with cycles of length neither 4 nor 6

DOI10.1360/012012-70zbMath1488.05206OpenAlexW2317220875MaRDI QIDQ5017791

Lingji Xu, Ying Qian Wang

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/012012-70

zbMATH Keywords

cycleplanar graphimproper coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (12)

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 (3,0,0)-colorable ⋮ Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable ⋮ Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable ⋮ Improper colorability of planar graphs without prescribed short cycles ⋮ Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable ⋮ Planar graphs with cycles of length neither 4 nor 7 are \((3,0,0)\)-colorable ⋮ \((1,0,0)\)-colorability of planar graphs without prescribed short cycles ⋮ Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable ⋮ Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable ⋮ \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\) ⋮ A relaxation of Novosibirsk 3-color conjecture

This page was built for publication: Improper colorability of planar graphs with cycles of length neither 4 nor 6