Coloring the square of a planar graph
From MaRDI portal
Publication:4797924
DOI10.1002/jgt.10077zbMath1008.05065MaRDI QIDQ4797924
Sean McGuinness, Jan van den Heuvel
Publication date: 10 March 2003
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.10077
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
\(L(p,q)\)-labelling of \(K_{4}\)-minor free graphs, The \(L(2,1)\)-labeling on planar graphs, Linear choosability of graphs, Labelling planar graphs without 4-cycles with a condition on distance two, Some results on distance two labelling of outerplanar graphs, Acyclic edge colorings of planar graphs and series parallel graphs, \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings, Distance constrained labelings of \(K_{4}\)-minor free graphs, Coloring the square of a \(K_{4}\)-minor free graph, \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree, Coloring squares of planar graphs with girth six, Labelling of some planar graphs with a condition at distance two, Labeling planar graphs with a condition at distance two, On the existence of specific stars in planar graphs, Chromatic number of square of maximal outerplanar graphs, A survey on the distance-colouring of graphs, On the \(L(p,1)\)-labelling of graphs, A bound on the chromatic number of the square of a planar graph, The \(L(2,1)\)-labelling of trees, 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
