Pages that link to "Item:Q2575546"
From MaRDI portal
The following pages link to Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable (Q2575546):
Displaying 30 items.
- An improved bound on 2-distance coloring plane graphs with girth 5 (Q306114) (← links)
- Coloring the square of a sparse graph \(G\) with almost \(\varDelta(G)\) colors (Q317434) (← links)
- Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable (Q393358) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- On 2-distance coloring of plane graphs with girth 5 (Q516880) (← links)
- Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6 (Q536624) (← links)
- List injective colorings of planar graphs (Q615993) (← links)
- \(k\)-forested coloring of planar graphs with large girth (Q632996) (← links)
- List 2-facial 5-colorability of plane graphs with girth at least 12 (Q658054) (← links)
- Tree-like distance colouring for planar graphs of sufficient girth (Q668079) (← links)
- List coloring the square of sparse graphs with large degree (Q740267) (← links)
- The \(L(p, q)\)-labelling of planar graphs without 4-cycles (Q741764) (← links)
- Distance constrained labelings of planar graphs with no short cycles (Q967308) (← links)
- List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six (Q1024323) (← links)
- 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\) (Q1045187) (← links)
- List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles (Q1631690) (← links)
- Planar graphs of girth at least five are square \((\delta + 2)\)-choosable (Q1633752) (← links)
- 2-distance coloring of planar graphs with girth 5 (Q1679523) (← links)
- List \(r\)-hued chromatic number of graphs with bounded maximum average degrees (Q1709519) (← links)
- Sufficient conditions for a planar graph to be list edge \(\Delta \)-colorable and list totally \((\Delta +1)\)-colorable (Q1939571) (← links)
- 2-distance list \((\Delta +2)\)-coloring of planar graphs with girth at least 10 (Q2165285) (← links)
- Graph \(r\)-hued colorings -- a survey (Q2172387) (← links)
- \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\) (Q2225423) (← links)
- Sufficient conditions for the minimum 2-distance colorability of plane graphs of girth 6 (Q2371270) (← links)
- Optimal \(r\)-dynamic coloring of sparse graphs (Q2424825) (← links)
- Coloring squares of planar graphs with girth six (Q2427536) (← links)
- Degeneracy and colorings of squares of planar graphs without 4-cycles (Q2658379) (← links)
- 2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles (Q5232154) (← links)
- 2-distance \((\Delta + 1)\)-coloring of sparse graphs using the potential method (Q6635121) (← links)
- The 2-distance chromatic number of planar graphs without 3,4,8-cycles (Q6645214) (← links)
