Circuits through prescribed edges
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2018
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914808302927872 |
|---|---|
| author | Knappe, Paul Pitz, Max |
| author_facet | Knappe, Paul Pitz, Max |
| contents | We prove that a connected graph contains a circuit---a closed walk that repeats no edges---through any $k$ prescribed edges if and only if it contains no odd cut of size at most $k$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1810_09323 |
| institution | arXiv |
| publishDate | 2018 |
| record_format | arxiv |
| spellingShingle | Circuits through prescribed edges Knappe, Paul Pitz, Max Combinatorics 05C38, 05C40, 05C45 We prove that a connected graph contains a circuit---a closed walk that repeats no edges---through any $k$ prescribed edges if and only if it contains no odd cut of size at most $k$. |
| title | Circuits through prescribed edges |
| topic | Combinatorics 05C38, 05C40, 05C45 |
| url | https://arxiv.org/abs/1810.09323 |