A relaxation of Novosibirsk 3-color conjecture
type: Item
instance of: scholarly article
title: A relaxation of Novosibirsk 3-color conjecture
zbMATH Open document ID: 1482.05108
author: Ziwen Huang
published in: Discrete Mathematics
publication date: 2022-02-14T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 7473525
zbMATH Keywords: Novosibirsk \(3\)-color conjecture
zbMATH Keywords: bad cycles
zbMATH Keywords: superextension
zbMATH Keywords: discharging
MaRDI profile type: Publication
Wikidata QID: Q113877037
full work available at URL: j.disc.2021.112762
OpenAlex ID: W4200616185
cites work: A sufficient condition for planar graphs to be 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: Colorings of plane graphs: a survey
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: Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
cites work: Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable
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: Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable
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: Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable
cites work: Q3139765
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
cites work: Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable
DOI: 10.1016/J.DISC.2021.112762
description: scientific article; zbMATH DE number 7473525