Abstract
We prove that ifS is a set ofk−1 vertices in ak-connected graphG, then the cycles throughS generate the cycle space ofG. Moreover, whenk≧3, each cycle ofG can be expressed as the sum of an odd number of cycles throughS. On the other hand, ifS is a set ofk vertices, these conclusions do not necessarily hold, and we characterize the exceptional cases. As corollaries, we establish the existence of odd and even cycles through specified vertices and deduce the existence of long odd and even cycles in graphs of high connectivity.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
V. Chvátal andP. Erdős, A note on Hamiltonian circuits,Discrete Math. 2 (1972), 111–113.
G. A. Dirac, In abstrakten Graphen vorhandene vollständige 4-Graphen und ihre Unterteilungen,Math. Nachr. 22 (1960), 61–85.
G. A. Dirac andC. Thomassen, Graphs in which every finite path is contained in a circuit,Math. Ann. 203 (1973), 65–75.
D. A. Holton, B. D. McKay andM. D. Plummer, Cycles through specified vertices in 3-connected cubic graphs, preprint,University of Melbourne, 1979.
J. M. Kinney andC. C. Alexander, Connectivity and traceability,preprint, 1978.
D. R. Lick, Characterizations ofn-connected andn-line connected graphs,J. Combinatorial Theory Ser. B,14 (1973), 122–124.
L. Lovász, Research problem 5,Period. Math. Hungar. 4 (1974), 82.
L. Lovász, in vol. II ofCombinatorics (A. Hajnal and Vera T. Sós, eds.),Colloquia Mathematica Societatis János Bolyai 18, North-Holland Publishing Co., New York, 1978, p. 1208.
M. Mamoun,untitled preprint, 1979.
H. Perfect, Applications of Menger’s graph theorem,J. Math. Anal. Appl. 22 (1968), 96–111.
M. D. Plummer, On path properties versus connectivity, I., inProc. Second Louisiana Conf. on Combinatorics, Graph Theory, and Computing, Louisiana State Univ., Baton Rouge, La. (1971), 457–472.
C. Thomassen, Note on circuits containing specified edges,J. Combinatorial Theory Ser. B,22 (1977), 279–280.
B. Toft, Problem 11 inRecent Advances in Graph Theory (M. Fiedler and J. Bosák, eds.), Academia, Prague, 1975, p. 544.
W. T. Tutte, Bridges and Hamiltonian circuits in planar graphs,Aequationes Math. 15 (1977), 1–33.
H.-J. Voss andC. Zuluaga, Maximale gerade und ungerade Kreise in Graphen I,Wiss. Z. Tech. Hochsch. Ilmenau 23 (1977), 57–70.
M. E. Watkins andD. M. Mesner, Cycles and connectivity in graphs,Canad. J. Math. 19 (1967), 1319–1328.
W. L. Wilson, R. L. Hemminger andM. D. Plummer, A family of path properties for graphs,Math. Ann. 197 (1972), 107–122.
D. R. Woodall, Circuits containing specified edges,J. Combinatorial Theory Ser. B 22 (1977), 274–278.