Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable
type: Item
instance of: scholarly article
title: Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable
zbMATH Open document ID: 1309.05058
author: Lingji Xu
author: Zhengke Miao
author: Yingqian Wang
published in: Journal of Combinatorial Optimization
publication date: 2015-01-21T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6388497
zbMATH Keywords: planar graph
zbMATH Keywords: Steinberg's conjecture
zbMATH Keywords: improper coloring
MaRDI profile type: Publication
full work available at URL: s10878-012-9586-4
OpenAlex ID: W2011909118
cites work: Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
cites work: Q4230860
cites work: List Improper Colourings of Planar Graphs
cites work: Q3139765
cites work: On $(3,1)^*$-Coloring of Plane Graphs
DOI: 10.1007/S10878-012-9586-4
description: scientific article; zbMATH DE number 6388497