Choosability of the square of planar subcubic graphs with large girth
From MaRDI portal
Publication:1025548
DOI10.1016/j.disc.2007.12.100zbMath1213.05084OpenAlexW2025662810MaRDI QIDQ1025548
Publication date: 19 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.100
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
\((d,1)\)-total labelling of planar graphs with large girth and high maximum degree, \(S\)-packing colorings of cubic graphs, List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles, Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable, Facially-constrained colorings of plane graphs: a survey, Exact square coloring of subcubic planar graphs, On list \(r\)-hued coloring of planar graphs, 2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4, Complexity of finding graph roots with girth conditions, List 3-dynamic coloring of graphs with small maximum average degree, List 2-facial 5-colorability of plane graphs with girth at least 12, Distance-two colourings of Barnette 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, The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes
Cites Work
