Circuits through prescribed vertices in k‐connected k‐regular graphs
Roland Häggkvist, Wolfgang Mader · Journal of Graph Theory · 2002
Abstract 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