The minimal nonplanar strong digraphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916647915225088 |
|---|---|
| author | Bartell, Stephen Seymour, Paul |
| author_facet | Bartell, Stephen Seymour, Paul |
| contents | Kuratowski's theorem says that the minimal (under subgraph containment) graphs that are not planar are the subdivisions of $K_5$ and of $K_{3,3}$. Here we study the minimal (under subdigraph containment) strongly-connected digraphs that are not planar. We also find the minimal strongly-connected non-outerplanar digraphs and the minimal strongly-connected non-series-parallel digraphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_06718 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The minimal nonplanar strong digraphs Bartell, Stephen Seymour, Paul Combinatorics 05C10, 05C20 Kuratowski's theorem says that the minimal (under subgraph containment) graphs that are not planar are the subdivisions of $K_5$ and of $K_{3,3}$. Here we study the minimal (under subdigraph containment) strongly-connected digraphs that are not planar. We also find the minimal strongly-connected non-outerplanar digraphs and the minimal strongly-connected non-series-parallel digraphs. |
| title | The minimal nonplanar strong digraphs |
| topic | Combinatorics 05C10, 05C20 |
| url | https://arxiv.org/abs/2503.06718 |