A relaxation of Novosibirsk 3-color conjecture
From MaRDI portal
Publication:2075515
DOI10.1016/J.DISC.2021.112762zbMath1482.05108OpenAlexW4200616185WikidataQ113877037 ScholiaQ113877037MaRDI QIDQ2075515
Publication date: 14 February 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2021.112762
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
Cites Work
- Unnamed Item
- Steinberg's conjecture is false
- Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
- Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable
- Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
- Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable
- Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable
- Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable
- Some simplified NP-complete graph problems
- A sufficient condition for planar graphs to be 3-colorable
- Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable
- Colorings of plane graphs: a survey
- Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable
- A relaxation of the Bordeaux conjecture
- Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable
- 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
- A relaxation of the strong Bordeaux Conjecture
- Improper colorability of planar graphs with cycles of length neither 4 nor 6
- On $(3,1)^*$-Coloring of Plane Graphs
- A Relaxation of Steinberg's Conjecture
This page was built for publication: A relaxation of Novosibirsk 3-color conjecture
