On coloring box graphs

DOI10.1016/J.DISC.2014.09.004MaRDI QIDQ472968zbMATH OpenOpenAlexFDO

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

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

chromatic numbergraph coloringbox graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Colouring triangle-free intersection graphs of boxes on the plane
• Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs
• Subcomplexes of box complexes of graphs
• Some properties of Bowlin and Brin's color graphs
• On the chromatic number of cube-like graphs

Cites work

• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 2042230 (Why is no real title available?)
• Every planar map is four colorable
• Higher-Dimensional Analogues of the Map Coloring Problem
• On almost \((k-1)\)-degenerate \((k+1)\)-chromatic graphs and hypergraphs
• Rhombic Penrose Tilings Can be 3-Colored

Cited in

(7)

• Some properties of Bowlin and Brin's color graphs
• Coloring rectangular blocks in 3-space
• Subcomplexes of box complexes of graphs
• On pallets for Fox colorings of spatial graphs
• Two-floor buildings need eight colors
• scientific article; zbMATH DE number 6381708 (Why is no real title available?)
• Graphs obtained from collections of blocks

This page was built for publication: On coloring box graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q472968)