Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable
type: Item
instance of: scholarly article
title: Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable
zbMATH Open document ID: 1327.05073
author: Ming Chen
author: Jinghan Xu
author: Yingqian Wang
author: Pei-Pei Liu
published in: Discrete Mathematics
publication date: 2015-12-08T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 6517695
zbMATH Keywords: Steinberg's conjecture
zbMATH Keywords: improper coloring
zbMATH Keywords: bad cycles
zbMATH Keywords: super extension
zbMATH Keywords: discharging
MaRDI profile type: Publication
full work available at URL: j.disc.2015.10.029
OpenAlex ID: W2150902778
cites work: Q4000782
cites work: Every planar map is four colorable. I: Discharging
cites work: Every planar map is four colorable. II: Reducibility
cites work: Q5422499
cites work: Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
cites work: Planar graphs without cycles of length from 4 to 7 are 3-colorable
cites work: \((1,0,0)\)-colorability of planar graphs without prescribed short cycles
cites work: Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
cites work: Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
cites work: A Relaxation of Steinberg's Conjecture
cites work: Planar graphs with cycles of length neither 4 nor 7 are \((3,0,0)\)-colorable
cites work: A note on list improper coloring planar graphs
cites work: Planar graphs without cycles of length 4 or 7 are (2, 0, 0)-colorable
cites work: A note on the three color problem
cites work: Q3139765
cites work: 没有4至6-圈的平面图是(1,0,0)-可染的
cites work: Improper Choosability of Planar Graphs without 4-Cycles
cites work: Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable
cites work: Improper colorability of planar graphs without prescribed short cycles
cites work: Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph
cites work: \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9
cites work: On $(3,1)^*$-Coloring of Plane Graphs
cites work: Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable
cites work: Improper colorability of planar graphs with cycles of length neither 4 nor 6
DOI: 10.1016/J.DISC.2015.10.029
description: scientific article; zbMATH DE number 6517695