Premium
Circuits through prescribed edges
Author(s) -
Knappe Paul,
Pitz Max
Publication year - 2020
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.22497
Subject(s) - mathematics , combinatorics , multiple edges , graph , electronic circuit , discrete mathematics , topology (electrical circuits) , physics , quantum mechanics
We prove that a connected graph G contains a circuit—a closed walk that repeats no edges—through any k prescribed edges if and only if G contains no odd cut of size at most k .