Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable

DOI10.1016/j.disc.2017.11.002zbMath1378.05070OpenAlexW2769427179MaRDI QIDQ1690217

Chuanni Zhang, Ying Qian Wang, Hua Jun Zhang, Zheng-Ke Miao

Publication date: 19 January 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2017.11.002

zbMATH Keywords

bad cyclesgraph operationreducible configurationsuper extension\((k, d)\)-coloringNsk3CC

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Related Items

Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable, Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph, A relaxation of Novosibirsk 3-color conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Steinberg's conjecture is false
• Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph
• A note on list improper coloring of plane graphs
• Every planar map is four colorable. I: Discharging
• A sufficient condition for planar graphs to be 3-colorable
• Colorings of plane graphs: a survey
• Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• On $(3,1)^*$-Coloring of Plane Graphs
• Improper Choosability of Planar Graphs without 4-Cycles
• A note on list improper coloring planar graphs