\((k,1)\)-coloring of sparse graphs
From MaRDI portal
Publication:409448
DOI10.1016/J.DISC.2011.11.031zbMath1238.05084OpenAlexW1800793356MaRDI QIDQ409448
Oleg V. Borodin, Anna O. Ivanova, Andre Raspaud, Mickaël Montassier
Publication date: 13 April 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.11.031
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)
Related Items (12)
On 1-improper 2-coloring of sparse graphs ⋮ \((k,j)\)-coloring of sparse graphs ⋮ Sparse critical graphs for defective DP-colorings ⋮ Defective 2-colorings of sparse graphs ⋮ (1,k)-Coloring of Graphs with Girth at Least Five on a Surface ⋮ On 2-defective DP-colorings of sparse graphs ⋮ Defective DP-colorings of sparse multigraphs ⋮ List strong linear 2-arboricity of sparse graphs ⋮ Defective DP-colorings of sparse simple graphs ⋮ Near-colorings: non-colorable graphs and NP-completeness ⋮ Defective and clustered choosability of sparse graphs ⋮ Limits of Near-Coloring of Sparse Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Circular \((5,2)\)-coloring of sparse graphs
- Path partitions of planar graphs
- Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k
- Oriented 5-coloring of sparse plane graphs
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- On the total coloring of planar graphs.
- List Improper Colourings of Planar Graphs
- Improper choosability of graphs and maximum average degree
This page was built for publication: \((k,1)\)-coloring of sparse graphs
