Contact graphs of boxes with unidirectional contacts

Abstract

This paper is devoted to the study of particular geometrically defined intersection classes of graphs. Those were previously studied by Magnant and Martin, who proved that these graphs have arbitrary large chromatic number, while being triangle-free. We give several structural properties of these graphs, and we raise several questions.

Keywords

• computer science - discrete mathematics
• mathematics - combinatorics