Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable
type: Item
instance of: scholarly article
title: Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable
zbMATH Open document ID: 1343.05054
author: Chuanni Zhang
author: Min Chen
author: Yingqian Wang
published in: Discrete Mathematics
publication date: 2016-08-16T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6617200
zbMATH Keywords: planar graph
zbMATH Keywords: \((d_1,d_2,\ldots,d_k)\)-coloring
zbMATH Keywords: reducible configuration
zbMATH Keywords: discharging
MaRDI profile type: Publication
full work available at URL: j.disc.2016.06.011
OpenAlex ID: W2500835095
cites work: Q4000782
cites work: Q5422499
cites work: Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
cites work: Q4374713
cites work: Q4811813
cites work: Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable
cites work: Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable
cites work: Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
cites work: Planar graphs without cycles of length from 4 to 7 are 3-colorable
cites work: Planar graphs without adjacent cycles of length at most seven are 3-colorable
cites work: A sufficient condition for planar graphs to be 3-colorable
cites work: Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable
cites work: Steinberg's conjecture is false
cites work: Some simplified NP-complete graph problems
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: A relaxation of the strong Bordeaux Conjecture
cites work: Distance constraints on short cycles for 3-colorability of planar graphs
cites work: A relaxation of the Bordeaux conjecture
cites work: Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable
cites work: A relaxation of Havel's 3-color problem
cites work: A note on the three color problem
cites work: Q3139765
cites work: On 3-colorability of planar graphs without adjacent short cycles
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: A 3-color theorem on plane graphs without 5-circuits
cites work: On $(3,1)^*$-Coloring of Plane Graphs
cites work: \((1,0,0)\)-colorability of planar graphs without prescribed short cycles
DOI: 10.1016/J.DISC.2016.06.011
description: scientific article; zbMATH DE number 6617200