The following pages link to (Q3115641):
Displaying 23 items.
- Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable (Q393358) (← links)
- \((k,1)\)-coloring of sparse graphs (Q409448) (← links)
- Injective choosability of planar graphs of girth five and six (Q409477) (← links)
- List injective colorings of planar graphs (Q615993) (← links)
- List 2-facial 5-colorability of plane graphs with girth at least 12 (Q658054) (← links)
- Injective colorings of sparse graphs (Q710598) (← links)
- Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\) (Q741736) (← links)
- The \(L(p, q)\)-labelling of planar graphs without 4-cycles (Q741764) (← links)
- List 2-distance coloring of planar graphs (Q887861) (← 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)
- The List \(L(2, 1)\)-labeling of planar graphs (Q1637136) (← links)
- Sufficient conditions for a planar graph to be list edge \(\Delta \)-colorable and list totally \((\Delta +1)\)-colorable (Q1939571) (← links)
- Injective choosability of subcubic planar graphs with girth 6 (Q2012551) (← links)
- List 2-distance coloring of planar graphs with girth five (Q2155644) (← links)
- Two smaller upper bounds of List injective chromatic number (Q2253957) (← links)
- List injective coloring of planar graphs with girth 5, 6, 8 (Q2446315) (← links)
- List 2-arboricity of planar graphs with no triangles at distance less than two (Q2454493) (← links)
- \((2+\epsilon )\)-nonrepetitive list colouring of paths (Q2631100) (← links)
- 2-distance coloring of sparse graphs (Q2857337) (← links)
- (Q4906312) (← links)
- (Q5391631) (← links)
- 2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4 (Q6041534) (← links)
