Coloring the square of a \(K_{4}\)-minor free graph
From MaRDI portal
Publication:1402088
DOI10.1016/S0012-365X(03)00059-1zbMath1027.05042OpenAlexW2090345684MaRDI QIDQ1402088
Ko-Wei Lih, Xuding Zhu, Wei Fan Wang
Publication date: 19 August 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00059-1
Related Items (44)
Hadwiger's conjecture for squares of 2-trees ⋮ \(L(p,q)\)-labelling of \(K_{4}\)-minor free graphs ⋮ A note on 2-facial coloring of plane graphs ⋮ Injective coloring of some graph operations ⋮ 2-distance list \((\Delta +2)\)-coloring of planar graphs with girth at least 10 ⋮ Graph \(r\)-hued colorings -- a survey ⋮ Facial edge-face coloring of \(K_4\)-minor-free graphs ⋮ Strong chromatic index of \(K_4\)-minor free graphs ⋮ Odd induced subgraphs in graphs with treewidth at most two ⋮ Some results on the injective chromatic number of graphs ⋮ List star edge-coloring of \(k\)-degenerate graphs and \(K_4\)-minor free graphs ⋮ On \(r\)-hued coloring of \(K_4\)-minor free graphs ⋮ 2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4 ⋮ Decomposition and \(r\)-hued coloring of \(K_4(7)\)-minor free graphs ⋮ Oriented vertex and arc colorings of partial 2-trees ⋮ Bounding the chromatic number of squares of \(K_4\)-minor-free graphs ⋮ On \(r\)-hued coloring of planar graphs with girth at least 6 ⋮ Coloring squares of planar graphs with maximum degree at most five ⋮ List \(r\)-hued chromatic number of graphs with bounded maximum average degrees ⋮ A unified approach to distance-two colouring of graphs on surfaces ⋮ Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs ⋮ \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\) ⋮ List-colouring the square of a \(K_4\)-minor-free graph ⋮ Signature of power graphs ⋮ Chromatic number of square of maximal outerplanar graphs ⋮ Labelling planar graphs without 4-cycles with a condition on distance two ⋮ A survey on the distance-colouring of graphs ⋮ Upper bounds of \(r\)-hued colorings of planar graphs ⋮ Homomorphisms of 2-edge-colored graphs ⋮ Injective coloring of planar graphs ⋮ Oriented colorings of partial 2-trees ⋮ The complexity of frugal colouring ⋮ Finding cut-vertices in the square roots of a graph ⋮ Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\) ⋮ On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs ⋮ Some results on distance two labelling of outerplanar graphs ⋮ Distance constrained labelings of \(K_{4}\)-minor free graphs ⋮ A Brooks-type bound for squares of \(K_{4}\)-minor-free graphs ⋮ 2-distance list \((\varDelta +3)\)-coloring of sparse graphs ⋮ Edge-partition and star chromatic index ⋮ Coloring squares of graphs via vertex orderings ⋮ Straight-line monotone grid drawings of series–parallel graphs ⋮ The list 2-distance coloring of a graph with Δ(G) = 5 ⋮ Distance Constrained Labelings of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>-minor Free Graphs
Cites Work
This page was built for publication: Coloring the square of a \(K_{4}\)-minor free graph
