List 2-distance (+1)-coloring of planar graphs with girth at least 7
From MaRDI portal
Publication:3115232
zbMATH Open1249.05118MaRDI QIDQ3115232FDOQ3115232
Publication date: 20 February 2012
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 (14)
- List injective coloring of planar graphs with girth \(g \geq 6\)
- List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six
- List injective colorings of planar graphs
- On the weak 2-coloring number of planar graphs
- Sufficient conditions for the minimum 2-distance colorability of plane graphs of girth 6
- The \(L(p, q)\)-labelling of planar graphs without 4-cycles
- Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable
- On list \(r\)-hued coloring of planar graphs
- List 2-facial 5-colorability of plane graphs with girth at least 12
- Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
- Optimal \(r\)-dynamic coloring of sparse graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6
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)
