Vertex ordering characterizations of interval r-graphs
Discrete Mathematics
2026-01-30 v2 Combinatorics
Abstract
An r-partite graph is an interval r-graph if corresponding to each vertex we can assign an interval of the real line such that two vertices u and v of different partite sets are adjacent if and only if their corresponding intervals intersect. In this paper, we provide two vertex-ordering characterizations of interval r-graphs and identify forbidden patterns for interval r-graphs in terms of specific orderings of their vertices.
Keywords
Cite
@article{arxiv.2601.11158,
title = {Vertex ordering characterizations of interval r-graphs},
author = {Indrajit Paul and Ashok Kumar Das},
journal= {arXiv preprint arXiv:2601.11158},
year = {2026}
}