2026/01/16 by Indrajit Paul, Ashok Kumar Das · 1 voice
Computer Science · Mathematics · #cs.DM #math.CO
paper · pdf · doi:10.48550/arxiv.2601.11158
arxiv published 2026/01/16 · arxiv updated 2026/01/29
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.