The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles
From MaRDI portal
Publication:2685340
DOI10.1016/j.disc.2022.113306OpenAlexW4313498883MaRDI QIDQ2685340
Publication date: 21 February 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2022.113306
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
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
- An introduction to the discharging method via graph coloring
- Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable
- Complexity and kernels for bipartition into degree-bounded induced graphs
- 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
- Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
- Defective 2-colorings of planar graphs without 4-cycles and 5-cycles
- Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable
- Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests
- Near-colorings: non-colorable graphs and NP-completeness
- Planar graphs with girth at least 5 are \((3, 4)\)-colorable
- Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable
- Defective 2-colorings of sparse graphs
- (1,k)-Coloring of Graphs with Girth at Least Five on a Surface
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- Improper choosability of graphs and maximum average degree
This page was built for publication: The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles
