Characterisations of Intersection Graphs by Vertex Orderings
<|reference_start|>Characterisations of Intersection Graphs by Vertex Orderings: 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.<|reference_end|>
@article{wood2004characterisations,
    title={Characterisations of Intersection Graphs by Vertex Orderings},
    author={David R. Wood},
    journal={Australasian J. Combinatorics 34:261-268, 2006},
    year={2004},
    archivePrefix={arXiv},
    eprint={cs/0404031},
    primaryClass={cs.DM}
}