没有4至6-圈的平面图是(1,0,0)-可染的

DOI10.1360/012013-158zbMath1488.05205OpenAlexW3146584358MaRDI QIDQ5017810

Li-Gang Jin, Ying-Li Kang, 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/012013-158

zbMATH Keywords

bad cyclesdischargingSteinberg conjectureimproper coloringsuperextension

Mathematics Subject Classification ID

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

Related Items (4)

Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable ⋮ Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable ⋮ Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph ⋮ \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\)

This page was built for publication: 没有4至6-圈的平面图是(1,0,0)-可染的