Contact graphs of boxes with unidirectional contacts
Discrete Mathematics
2024-08-07 v4 Combinatorics
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.
Cite
@article{arxiv.2301.03865,
title = {Contact graphs of boxes with unidirectional contacts},
author = {Daniel Gonçalves and Vincent Limouzy and Pascal Ochem},
journal= {arXiv preprint arXiv:2301.03865},
year = {2024}
}
Comments
Minor change