Grid Intersection Graphs and Order Dimension
Combinatorics
2015-12-09 v1
Abstract
We study subclasses of grid intersection graphs from the perspective of order dimension. We show that partial orders of height two whose comparability graph is a grid intersection graph have order dimension at most four. Starting from this observation we provide a comprehensive study of classes of graphs between grid intersection graphs and bipartite permutation graphs and the containment relation on these classes. Order dimension plays a role in many arguments.
Keywords
Cite
@article{arxiv.1512.02482,
title = {Grid Intersection Graphs and Order Dimension},
author = {Steven Chaplick and Stefan Felsner and Udo Hoffmann and Veit Wiechert},
journal= {arXiv preprint arXiv:1512.02482},
year = {2015}
}
Comments
30 pages