scientific article
From MaRDI portal
Publication:3115641
zbMath1249.05114MaRDI QIDQ3115641
T. K. Neustroeva, Oleg V. Borodin, Anna O. Ivanova
Publication date: 10 February 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
Related Items
The List \(L(2, 1)\)-labeling of planar graphs ⋮ List injective colorings of planar graphs ⋮ \((k,1)\)-coloring of sparse graphs ⋮ Injective choosability of planar graphs of girth five and six ⋮ List injective coloring of planar graphs with girth 5, 6, 8 ⋮ List 2-facial 5-colorability of plane graphs with girth at least 12 ⋮ Two smaller upper bounds of List injective chromatic number ⋮ Unnamed Item ⋮ Injective choosability of subcubic planar graphs with girth 6 ⋮ Injective colorings of sparse graphs ⋮ Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\) ⋮ The \(L(p, q)\)-labelling of planar graphs without 4-cycles ⋮ List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six ⋮ 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
This page was built for publication:
