scientific article; zbMATH DE number 6004909
From MaRDI portal
Publication:3115641
zbMATH Open1249.05114MaRDI QIDQ3115641FDOQ3115641
T. K. Neustroeva, Oleg V. Borodin, Anna O. Ivanova
Publication date: 10 February 2012
Title of this publication is not available (Why is that?)
Recommendations
- List 2-distance \((\Delta+1)\)-coloring of planar graphs with girth at least 7
- 2-distance list \((\Delta +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\)
Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)
Cited In (23)
- \((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
- Title not available (Why is that?)
- 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
- The List \(L(2, 1)\)-labeling of planar graphs
- Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable
- 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
- Title not available (Why is that?)
- Injective choosability of planar graphs of girth five and six
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)
