Planar graphs without cycles of length 4 or 9 are $\boldsymbol{(2,~0,~0)}$-colorable

DOI10.1360/N012018-00129zbMath1499.05207OpenAlexW3009140983MaRDI QIDQ5064172

Jingfang Nie, Weiqiang Yu, Min Chen, Lifeng Dai, Ying Qian Wang

Publication date: 21 March 2022

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

Full work available at URL: https://doi.org/10.1360/n012018-00129

zbMATH Keywords

reducibilityplanar graphSteinberg's conjecture\((2,0,0)\)-coloring

Mathematics Subject Classification ID

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

This page was built for publication: Planar graphs without cycles of length 4 or 9 are $\boldsymbol{(2,~0,~0)}$-colorable