2-distance coloring of sparse graphs
DOI10.1002/JGT.21782zbMATH Open1304.05042OpenAlexW2148916877MaRDI QIDQ6486785FDOQ6486785
Authors: Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou 
Publication date: 17 November 2014
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01233451/file/blp11.pdf
Recommendations
- 2-distance coloring of sparse graphs
- Distance-two coloring of sparse graphs
- 2-distance coloring of sparse planar graphs
- 2-distance coloring of sparse planar graphs
- The list 2-distance coloring of sparse graphs
- Near-proper vertex 2-colorings of sparse graphs
- 2-distance colorings of integer distance graphs
- Further results on 2-distance coloring of graphs
- 2-distance list \((\varDelta +3)\)-coloring of sparse graphs
Graph algorithms (graph-theoretic aspects) (05C85) 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
- On the maximum average degree and the oriented chromatic number of a graph
- On the total coloring of planar graphs.
- Coloring squares of planar graphs with girth six
- 2-distance coloring of sparse planar graphs
- Labeling Planar Graphs with Conditions on Girth and Distance Two
- 2-distance coloring of sparse graphs
- Counterexamples to the list square coloring conjecture
- Choosability conjectures and multicircuits
- Title not available (Why is that?)
- 2-distance 4-colorability of planar subcubic graphs with girth at least 22
- Distance constrained labelings of planar graphs with no short cycles
This page was built for publication: 2-distance coloring of sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6486785)
