List Colouring Squares of Planar Graphs
From MaRDI portal
Publication:3503513
DOI10.1016/j.endm.2007.07.079zbMath1341.05073arXiv0807.3233OpenAlexW1976272966MaRDI QIDQ3503513
Jan van den Heuvel, Frédéric Havet, Colin J. H. McDiarmid, Bruce A. Reed
Publication date: 5 June 2008
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0807.3233
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (37)
List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles ⋮ Sharp upper bound of injective coloring of planar graphs with girth at least 5 ⋮ 2-distance list \((\Delta +2)\)-coloring of planar graphs with girth at least 10 ⋮ Degeneracy and colorings of squares of planar graphs without 4-cycles ⋮ Exact square coloring of subcubic planar graphs ⋮ Graph \(r\)-hued colorings -- a survey ⋮ Cyclic coloring of plane graphs with maximum face size 16 and 17 ⋮ \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) ⋮ On list \(r\)-hued coloring of planar graphs ⋮ Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable ⋮ List Colouring Squares of Planar Graphs ⋮ Square Coloring Planar Graphs with Automatic Discharging ⋮ Improved square coloring of planar graphs ⋮ 2-distance coloring of planar graphs without adjacent 5-cycles ⋮ A unified approach to distance-two colouring of graphs on surfaces ⋮ Distributed colorings for collision-free routing in sink-centric sensor networks ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Cyclic colorings of plane graphs with independent faces ⋮ Tree-like distance colouring for planar graphs of sufficient girth ⋮ Coloring the square of Sierpiński graphs ⋮ An introduction to the discharging method via graph coloring ⋮ Facial colorings using Hall's theorem ⋮ Coloring the square of the Cartesian product of two cycles ⋮ The complexity of frugal colouring ⋮ Coloring plane graphs with independent crossings ⋮ Third Case of the Cyclic Coloring Conjecture ⋮ List 2-distance coloring of planar graphs without short cycles ⋮ The distance coloring of 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 ⋮ List‐Coloring the Squares of Planar Graphs without 4‐Cycles and 5‐Cycles ⋮ The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes ⋮ A Brooks-type bound for squares of \(K_{4}\)-minor-free graphs ⋮ 2-distance list \((\varDelta +3)\)-coloring of sparse graphs ⋮ Angular Resolutions: Around Vertices and Crossings ⋮ 2-distance choice number of planar graphs with maximal degree no more than 4
Cites Work
This page was built for publication: List Colouring Squares of Planar Graphs
