(k,1)-coloring of sparse graphs
From MaRDI portal
Publication:409448
DOI10.1016/J.DISC.2011.11.031zbMATH Open1238.05084OpenAlexW1800793356MaRDI QIDQ409448FDOQ409448
Oleg V. Borodin, André Raspaud, Anna O. Ivanova, 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
Recommendations
- On 1-improper 2-coloring of sparse graphs
- Near-proper vertex 2-colorings of sparse graphs
- (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\)
- \((k,j)\)-coloring of sparse graphs
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)
Cites Work
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- On the total coloring of planar graphs.
- Title not available (Why is that?)
- List Improper Colourings of Planar Graphs
- Oriented 5-coloring of sparse plane graphs
- Improper choosability of graphs and maximum average degree
- Path partitions of planar graphs
- Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k
- Title not available (Why is that?)
- Title not available (Why is that?)
- Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1
- Circular \((5,2)\)-coloring of sparse graphs
Cited In (16)
- \((k,j)\)-coloring of sparse graphs
- \(k\)-forested coloring of sparse graphs
- Near-colorings: non-colorable graphs and NP-completeness
- On 1-improper 2-coloring of sparse graphs
- On 2-defective DP-colorings of sparse graphs
- Defective 2-colorings of sparse graphs
- List strong linear 2-arboricity of sparse graphs
- A GRASP for coloring sparse graphs
- Sparse critical graphs for defective DP-colorings
- Limits of near-coloring of sparse graphs
- Defective and clustered choosability of sparse graphs
- (1,k)-Coloring of Graphs with Girth at Least Five on a Surface
- Sparse \(H\)-colourable graphs of bounded maximum degree
- Defective DP-colorings of sparse multigraphs
- Defective DP-colorings of sparse simple graphs
- A Complexity Dichotomy for the Coloring of Sparse Graphs
This page was built for publication: \((k,1)\)-coloring of sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409448)
