Coloring the square of a \(K_{4}\)-minor free graph

DOI10.1016/S0012-365X(03)00059-1zbMath1027.05042MaRDI QIDQ1402088

Xuding Zhu, Ko-Wei Lih, Wei Fan Wang

Publication date: 19 August 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

square; chromatic number; series-parallel graph; \(K_4\)-minor free graph

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

Related Items

Homomorphisms of 2-edge-colored graphs, Injective coloring of planar graphs, \(L(p,q)\)-labelling of \(K_{4}\)-minor free graphs, A note on 2-facial coloring of plane graphs, List-colouring the square of a \(K_4\)-minor-free graph, Labelling planar graphs without 4-cycles with a condition on distance two, Oriented colorings of partial 2-trees, 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, Chromatic number of square of maximal outerplanar graphs, A survey on the distance-colouring of graphs, 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, Oriented vertex and arc colorings of partial 2-trees

Cites Work

• Topology of series-parallel networks
• A bound on the chromatic number of the square of a planar graph
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Coloring the square of a planar graph
• Unnamed Item
• Unnamed Item
• Unnamed Item