A Generalization of a Theorem of Dirac

doi:10.1006/jctb.2001.2041

Journal of Combinatorial Theory, Series B

Volume 82, Issue 2, July 2001, Pages 322-326

https://doi.org/10.1006/jctb.2001.2041 Get rights and content

Under an Elsevier user license

open archive

Abstract

In this paper, we give a generalization of a well-known result of Dirac that given any k vertices in a k-connected graph where k⩾2, there is a circuit containing all of them. We also generalize a result of Häggkvist and Thomassen. Our main result partially answers an open matroid question of Oxley.

Cited by (0)

¹: The research of this author was partially supported by the Louisiana Board of Regents Support Fund LEQSF (1999-2002)-RD-A-34. His current address is Department of Mathematics, The University of Mississippi.

Journal of Combinatorial Theory, Series B

NoteA Generalization of a Theorem of Dirac

Abstract

Note
A Generalization of a Theorem of Dirac