A sufficient condition for planar graphs with girth 5 to be \((1,6)\)-colorable
From MaRDI portal
Publication:6585548
DOI10.1016/j.amc.2024.128706zbMATH Open1545.05082MaRDI QIDQ6585548
Could not fetch data.
Publication date: 12 August 2024
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
- Planar graphs with girth at least 5 are \((3, 5)\)-colorable
- Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable
- Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Every planar graph with girth at least 5 is \((1,9)\)-colorable
- Near-colorings: non-colorable graphs and NP-completeness
- On the vertex partition of planar graphs into forests with bounded degree
- Planar graphs with girth at least 5 are \((3, 4)\)-colorable
- A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable
- Defective 2-colorings of sparse graphs
- Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable
- Planar graphs with cycles of length neither 4 nor 7 are \((3,0,0)\)-colorable
- (1,k)-Coloring of Graphs with Girth at Least Five on a Surface
- Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- List Improper Colourings of Planar Graphs
- On $(3,1)^*$-Coloring of Plane Graphs
- Improper choosability of graphs and maximum average degree
This page was built for publication: A sufficient condition for planar graphs with girth 5 to be \((1,6)\)-colorable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6585548)
