Coloring Powers of Planar Graphs
From MaRDI portal
Publication:4443117
DOI10.1137/S0895480100367950zbMath1029.05047OpenAlexW2029746920MaRDI QIDQ4443117
Geir Agnarsson, Magnús M. Halldórsson
Publication date: 8 January 2004
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480100367950
Related Items (45)
Chromatic numbers of exact distance graphs ⋮ Wegner's conjecture on 2-distance coloring ⋮ Wegner's conjecture on 2-distance coloring for planar graphs ⋮ On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations ⋮ On coloring numbers of graph powers ⋮ List 2-distance coloring of planar graphs ⋮ List injective colorings of planar graphs ⋮ Locally injective \(k\)-colourings of planar graphs ⋮ Improved square coloring of planar graphs ⋮ Coloring squares of planar graphs with girth six ⋮ Coloring squares of planar graphs with maximum degree at most five ⋮ Note on the game colouring number of powers of graphs ⋮ 2-distance choosability of planar graphs with a restriction for maximum degree ⋮ A unified approach to distance-two colouring of graphs on surfaces ⋮ 2-distance colorings of integer distance graphs ⋮ Algorithms for finding distance-edge-colorings of graphs ⋮ Tree-like distance colouring for planar graphs of sufficient girth ⋮ Labeling planar graphs with a condition at distance two ⋮ Vertex coloring acyclic digraphs and their corresponding hypergraphs ⋮ Labelling planar graphs without 4-cycles with a condition on distance two ⋮ An introduction to the discharging method via graph coloring ⋮ Parameterized complexity of coloring problems: treewidth versus vertex cover ⋮ Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6 ⋮ A bound on the chromatic number of the square of a planar graph ⋮ Finding cut-vertices in the square roots of a graph ⋮ Minimum 2-distance coloring of planar graphs and channel assignment ⋮ L(1,1)-Labeling of direct product of cycles ⋮ Unnamed Item ⋮ List injective coloring of planar graphs with girth \(g \geq 6\) ⋮ The distance coloring of graphs ⋮ Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\) ⋮ Colouring exact distance graphs of chordal graphs ⋮ 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 ⋮ 2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles ⋮ \(2\)-distance coloring of planar graphs with maximum degree \(5\) ⋮ \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings ⋮ Distance constrained labelings of \(K_{4}\)-minor free graphs ⋮ 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\) ⋮ Geodetic number of powers of cycles ⋮ On the connectivity of k-distance graphs ⋮ 2-Distance coloring of planar graph ⋮ The \(r\)-acyclic chromatic number of planar graphs ⋮ Linear-time algorithms for tree root problems ⋮ 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
This page was built for publication: Coloring Powers of Planar Graphs
