Vertex ordering characterizations of interval r-graphs
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.
Fields of Study & Subjects
Advanced Graph Theory Research
Complexity and Algorithms in Graphs
Limits and Structures in Graph Theory
Publication details
- Journal / source
- arXiv (Cornell University)
- Publication date
- 16 January 2026
- Document type
- Preprint