scientific article; zbMATH DE number 6004909
From MaRDI portal
Publication:3115641
Recommendations
- List 2-distance \((\Delta+1)\)-coloring of planar graphs with girth at least 7
- 2-distance list ( +2)-coloring of planar graphs with girth at least 10
- scientific article; zbMATH DE number 5875579
- List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six
- scientific article; zbMATH DE number 6135423
- List 2-distance coloring of planar graphs with girth five
- List 2-distance coloring of planar graphs
- List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles
- List 2-distance coloring of planar graphs with maximal degree less than 5
- A new result of list 2-distance coloring of planar graphs with \(g(G) \geq 5\)
Cited in
(24)- \((k,1)\)-coloring of sparse graphs
- 2-distance coloring of sparse graphs
- Injective colorings of sparse graphs
- List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six
- List injective colorings of planar graphs
- Injective choosability of subcubic planar graphs with girth 6
- 2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4
- \((2+\epsilon )\)-nonrepetitive list colouring of paths
- Sufficient conditions for the 2-distance \((\Delta+1)\)-colorability of planar graphs with girth 6
- scientific article; zbMATH DE number 6135423 (Why is no real title available?)
- Sufficient conditions for a planar graph to be list edge \(\Delta \)-colorable and list totally \((\Delta +1)\)-colorable
- List injective coloring of planar graphs with girth 5, 6, 8
- The L(p, q)-labelling of planar graphs without 4-cycles
- List 2-distance coloring of planar graphs
- Graphs with maximum degree 17 and maximum average degree less than 3 are list 2-distance ( +2)-colorable
- The List L(2, 1)-labeling of planar graphs
- 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
- Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\)
- Two smaller upper bounds of List injective chromatic number
- List 2-distance coloring of planar graphs with girth five
- List 2-arboricity of planar graphs with no triangles at distance less than two
- List 2-facial 5-colorability of plane graphs with girth at least 12
- Injective choosability of planar graphs of girth five and six
- scientific article; zbMATH DE number 5875579 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115641)
