Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable
type: Item
instance of: scholarly article
title: Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable
zbMATH Open document ID: 1378.05070
author: Chuanni Zhang
author: Zhengke Miao
author: Yingqian Wang
author: Hua Jun Zhang
published in: Discrete Mathematics
publication date: 2018-01-19T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C76
zbMATH DE Number: 6827495
zbMATH Keywords: \((k, d)\)-coloring
zbMATH Keywords: Nsk3CC
zbMATH Keywords: reducible configuration
zbMATH Keywords: graph operation
zbMATH Keywords: bad cycles
zbMATH Keywords: super extension
MaRDI profile type: Publication
full work available at URL: j.disc.2017.11.002
OpenAlex ID: W2769427179
cites work: Every planar map is four colorable. I: Discharging
cites work: Q5422499
cites work: Colorings of plane graphs: a survey
cites work: Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable
cites work: A sufficient condition for planar graphs to be 3-colorable
cites work: Steinberg's conjecture is false
cites work: Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
cites work: A note on list improper coloring of plane graphs
cites work: Q4857375
cites work: A note on list improper coloring planar graphs
cites work: Q3139765
cites work: Improper Choosability of Planar Graphs without 4-Cycles
cites work: Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph
cites work: On $(3,1)^*$-Coloring of Plane Graphs
DOI: 10.1016/J.DISC.2017.11.002
Recommended article: Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable
Recommended article: Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
Recommended article: Planar graphs without 5- and 8-cycles and adjacent triangles are 3-colorable
Recommended article: Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
Recommended article: Planar graphs without cycles of length 4 or 5 are \((11 : 3)\)-colorable
Recommended article: Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable
Recommended article: Planar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorable
Recommended article: Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable
Recommended article: 不含3圈和4圈的1-平面图是5-可染的
Recommended article: The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles
description: scientific article; zbMATH DE number 6827495