Circuits through prescribed edges
Combinatorics
2024-05-27 v1
Abstract
We prove that a connected graph contains a circuit---a closed walk that repeats no edges---through any prescribed edges if and only if it contains no odd cut of size at most .
Keywords
Cite
@article{arxiv.1810.09323,
title = {Circuits through prescribed edges},
author = {Paul Knappe and Max Pitz},
journal= {arXiv preprint arXiv:1810.09323},
year = {2024}
}
Comments
12 pages; 3 figures