Sufficient conditions for the minimum 2-distance colorability of plane graphs of girth 6

zbMath1119.05039MaRDI QIDQ2371270

T. K. Neustroeva, Oleg V. Borodin, Anna O. Ivanova

Publication date: 2 July 2007

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/53350

zbMATH Keywords

graph coloring problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (9)

Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable ⋮ List injective colorings of planar graphs ⋮ List 2-facial 5-colorability of plane graphs with girth at least 12 ⋮ An introduction to the discharging method via graph coloring ⋮ Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6 ⋮ List injective coloring of planar graphs with girth \(g \geq 6\) ⋮ 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: Sufficient conditions for the minimum 2-distance colorability of plane graphs of girth 6