Planar graphs without cycles of length 4 or 9 are $\boldsymbol{(2,~0,~0)}$-colorable
type: Item
instance of: scholarly article
title: Planar graphs without cycles of length 4 or 9 are $\boldsymbol{(2,~0,~0)}$-colorable
zbMATH Open document ID: 1499.05207
DOI: 10.1360/N012018-00129
author: Min Chen
author: Lifeng Dai
author: Jingfang Nie
author: Weiqiang Yu
author: Yingqian Wang
published in: SCIENTIA SINICA Mathematica
publication date: 2022-03-21T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 7494870
zbMATH Keywords: planar graph
zbMATH Keywords: Steinberg's conjecture
zbMATH Keywords: \((2,0,0)\)-coloring
zbMATH Keywords: reducibility
MaRDI profile type: MaRDI publication profile
full work available at URL: n012018-00129
OpenAlex ID: W3009140983
Recommended article: Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable
Recommended article: Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable
Recommended article: \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9
Recommended article: Planar graphs without cycles of length 4 or 7 are (2, 0, 0)-colorable
Recommended article: Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
Recommended article: 没有4至6-圈的平面图是(1,0,0)-可染的
Recommended article: Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable
Recommended article: The 3-colorability of planar graphs without cycles of length 4, 6 and 9
Recommended article: Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable
Recommended article: On the 3-colorability of planar graphs without \(\{4,8,9\}\)-cycles
description: scientific article; zbMATH DE number 7494870