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):
Displayed 15 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)
- 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)
- Coloring squares of planar graphs with girth six (Q2427536) (← links)