The following pages link to (Q5391631):
Displaying 12 items.
- 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)
- Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6 (Q536624) (← links)
- List injective colorings of planar graphs (Q615993) (← links)
- List injective coloring of planar graphs with girth \(g \geq 6\) (Q738861) (← links)
- Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\) (Q741736) (← links)
- List 2-distance coloring of planar graphs (Q887861) (← links)
- List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles (Q1631690) (← links)
- Injective choosability of subcubic planar graphs with girth 6 (Q2012551) (← links)
- List 2-distance coloring of planar graphs with girth five (Q2155644) (← links)
- 2-distance choosability of planar graphs with a restriction for maximum degree (Q2698256) (← links)
- A new result of list 2-distance coloring of planar graphs with g(G) ≥ 5 (Q4577850) (← links)