Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable
From MaRDI portal
Publication:2174590
DOI10.1016/j.disc.2020.111846zbMath1437.05061OpenAlexW3005694834MaRDI QIDQ2174590
Publication date: 21 April 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2020.111846
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Steinberg's conjecture is false
- Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph
- Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
- A note on list improper coloring of plane graphs
- 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
- Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph
- Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable
- Defective coloring revisited
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- On $(3,1)^*$-Coloring of Plane Graphs
- Improper Choosability of Planar Graphs without 4-Cycles
- A note on list improper coloring planar graphs
- Unnamed Item
- Unnamed Item
This page was built for publication: Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable
