Bounding the chromatic number of squares of \(K_4\)-minor-free graphs

DOI10.1016/j.disc.2019.03.011zbMath1414.05111OpenAlexW2935760749MaRDI QIDQ2421854

Zakir Deniz, Mehmet Akif Yetim, Yusuf Civan

Publication date: 18 June 2019

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

Full work available at URL: https://doi.org/10.1016/j.disc.2019.03.011

zbMATH Keywords

chromatic numbersquare graph\(K_4\)-minor-free graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

On the square coloring of comparability graphs ⋮ Graph \(r\)-hued colorings -- a survey ⋮ Coloring squares of graphs via vertex orderings

Cites Work

• Labelling planar graphs without 4-cycles with a condition on distance two
• 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
• A Brooks-type bound for squares of \(K_{4}\)-minor-free graphs
• Coloring the square of a \(K_{4}\)-minor free graph
• The square of a planar cubic graph is 7-colorable
• Colorings of plane graphs: a survey
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs