List-coloring the square of a subcubic graph

From MaRDI portal
Publication:3539931

DOI10.1002/jgt.20273zbMath1172.05023arXiv1503.00157OpenAlexW2952029290MaRDI QIDQ3539931

Daniel W. Cranston, Seog-Jin Kim

Publication date: 19 November 2008

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.00157




Related Items

\(S\)-packing colorings of cubic graphsPainting squares in \(\Delta^2-1\) shadesSharp upper bound of injective coloring of planar graphs with girth at least 52-distance list \((\Delta +2)\)-coloring of planar graphs with girth at least 10On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\)Graph \(r\)-hued colorings -- a surveyConnectivity of minimum non-5-injectively colorable planar cubic graphsAn optimal square coloring of planar graphsDynamic coloring parameters for graphs with given genusA survey on packing coloringsComplexity of finding graph roots with girth conditionsUnnamed ItemList 3-dynamic coloring of graphs with small maximum average degreeLinear colorings of subcubic graphsBrooks' theorem on powers of graphs\(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\)List \(r\)-dynamic coloring of graphs with small maximum average degreeDecomposition of cubic graphs related to Wegner's conjectureAn introduction to the discharging method via graph coloringInjective colorings of graphs with low average degreeThe distance coloring of graphsSufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\)List \(r\)-dynamic coloring of sparse graphsList‐Coloring the Squares of Planar Graphs without 4‐Cycles and 5‐CyclesChoosability of the square of planar subcubic graphs with large girthThe 2-distance coloring of the Cartesian product of cycles using optimal Lee codes2-distance list \((\varDelta +3)\)-coloring of sparse graphs



Cites Work


This page was built for publication: List-coloring the square of a subcubic graph