Circuits through prescribed edges
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.