Circuits through prescribed vertices in k-connected k-regular graphs

  • Authors:

  • Roland Häggkvist;Wolfgang Mader

  • Affiliations:

  • Department of Mathematics, University of Umeå, S-901 87 Umeå, Sweden;Institut für Mathematik, Welfengarten 1, D-30167 Hannover, Germany

  • Venue:
  • Journal of Graph Theory
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

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