On coloring box graphs

DOI10.1016/j.disc.2014.09.004zbMath1302.05053OpenAlexW2015223293MaRDI QIDQ472968

Ellen Veomett, Cindy Traub, Emilie Hogan, Joseph O'Rourke

Publication date: 20 November 2014

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

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

zbMATH Keywords

graph coloringchromatic numberbox graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• On almost \((k-1)\)-degenerate \((k+1)\)-chromatic graphs and hypergraphs
• Rhombic Penrose Tilings Can be 3-Colored
• Every planar map is four colorable
• Higher-Dimensional Analogues of the Map Coloring Problem

This page was built for publication: On coloring box graphs