List 2-distance (+1)-coloring of planar graphs with girth at least 7
From MaRDI portal
Publication:3115232
Recommendations
- scientific article; zbMATH DE number 6135423
- 2-distance \((\Delta+2)\)-coloring of sparse planar graphs with \(\Delta=3\)
- Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
- List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six
- scientific article; zbMATH DE number 5875579
Cited in
(16)- On the weak 2-coloring number of planar graphs
- List injective coloring of planar graphs with girth \(g \geq 6\)
- The \(L(p, q)\)-labelling of planar graphs without 4-cycles
- Sufficient conditions for the minimum 2-distance colorability of plane graphs of girth 6
- 2-distance \((\Delta+2)\)-coloring of sparse planar graphs with \(\Delta=3\)
- Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable
- List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six
- On list \(r\)-hued coloring of planar graphs
- List injective colorings of planar graphs
- scientific article; zbMATH DE number 6004909 (Why is no real title available?)
- List 2-facial 5-colorability of plane graphs with girth at least 12
- Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6
- scientific article; zbMATH DE number 5875579 (Why is no real title available?)
- Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
- 2-distance 4-coloring of planar subcubic graphs
- Optimal \(r\)-dynamic coloring of sparse graphs
This page was built for publication: List 2-distance \((\Delta+1)\)-coloring of planar graphs with girth at least 7
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115232)
