Contact graphs of boxes with unidirectional contacts
Daniel Gon\c{c}alves, Vincent Limouzy, Pascal Ochem

TL;DR
This paper investigates a special class of intersection graphs formed by boxes with unidirectional contacts, revealing structural properties and raising questions about their characteristics.
Contribution
It provides new structural insights into contact graphs of boxes with unidirectional contacts and explores their chromatic properties.
Findings
Graphs can have arbitrarily large chromatic number
They are triangle-free
Structural properties are identified
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Advanced Graph Theory Research · Computational Geometry and Mesh Generation
