A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable
From MaRDI portal
Publication:2359791
DOI10.1007/s10878-016-0010-3zbMath1367.05054OpenAlexW2330489031MaRDI QIDQ2359791
Min Chen, Miao Zhang, Yi Qiao Wang
Publication date: 22 June 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-016-0010-3
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
Every planar graph with girth at least 5 is \((1,9)\)-colorable ⋮ An (F1,F4)‐partition of graphs with low genus and girth at least 6 ⋮ An \((F_3,F_5)\)-partition of planar graphs with girth at least 5
Cites Work
- Unnamed Item
- Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
- On 1-improper 2-coloring of sparse graphs
- 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
- Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1
- Near-colorings: non-colorable graphs and NP-completeness
- Defective 2-colorings of sparse graphs
- Improper colorability of planar graphs without prescribed short cycles
- 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
- 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
- A Relaxation of Steinberg's Conjecture
- 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,7)\)-colorable
