Characterisations of Intersection Graphs by Vertex Orderings
Discrete Mathematics
2011-10-05 v1
Abstract
Characterisations of interval graphs, comparability graphs, co-comparability graphs, permutation graphs, and split graphs in terms of linear orderings of the vertex set are presented. As an application, it is proved that interval graphs, co-comparability graphs, AT-free graphs, and split graphs have bandwidth bounded by their maximum degree.
Cite
@article{arxiv.cs/0404031,
title = {Characterisations of Intersection Graphs by Vertex Orderings},
author = {David R. Wood},
journal= {arXiv preprint arXiv:cs/0404031},
year = {2011}
}
Comments
submitted