On coloring box graphs

DOI10.1016/J.DISC.2014.09.004zbMATH Open1302.05053OpenAlexW2015223293MaRDI QIDQ472968FDOQ472968

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

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

zbMATH Keywords

chromatic numbergraph coloringbox graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

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

Cited In (7)

• On pallets for Fox colorings of spatial graphs
• Title not available (Why is that?)
• Subcomplexes of box complexes of graphs
• Two-floor buildings need eight colors
• Some properties of Bowlin and Brin's color graphs
• Coloring rectangular blocks in 3-space
• 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)