2-distance coloring of sparse graphs
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 5279355 (Why is no real title available?)
- 2-distance 4-colorability of planar subcubic graphs with girth at least 22
- 2-distance coloring of sparse graphs
- 2-distance coloring of sparse planar graphs
- Choosability conjectures and multicircuits
- Coloring squares of planar graphs with girth six
- Counterexamples to the list square coloring conjecture
- Distance constrained labelings of planar graphs with no short cycles
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Labeling Planar Graphs with Conditions on Girth and Distance Two
- On the maximum average degree and the oriented chromatic number of a graph
- On the total coloring of planar graphs.
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)
