Premium
Circuits through prescribed vertices in k ‐connected k ‐regular graphs
Author(s) -
Häggkvist Roland,
Mader Wolfgang
Publication year - 2002
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.10011
Subject(s) - combinatorics , mathematics , graph , discrete mathematics
We show that every set of $k+\lfloor{1\over 3}\sqrt{k}\rfloor$ vertices in a k ‐connected k ‐regular graph belongs to some circuit. © 2002 John Wiley & Sons, Inc. J Graph Theory 39: 145–163, 2002