Vertex ordering characterizations of interval r-graphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910004120911872 |
|---|---|
| author | Paul, Indrajit Das, Ashok Kumar |
| author_facet | Paul, Indrajit Das, Ashok Kumar |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_11158 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Vertex ordering characterizations of interval r-graphs Paul, Indrajit Das, Ashok Kumar Discrete Mathematics Combinatorics 05C62 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. |
| title | Vertex ordering characterizations of interval r-graphs |
| topic | Discrete Mathematics Combinatorics 05C62 |
| url | https://arxiv.org/abs/2601.11158 |