Abstract
We give necessary and sufficient conditions for four edges in a 3-connected cubic graph to lie on a cycle. As a consequence, if such a graph is cyclically 4-edge-connected with order greater than 8 it is shown that any four independent edges lie on a cycle.
Similar content being viewed by others
References
Bussemaker, F.C., Cobeljic, S., Cvetkovic, D.M., Seidel, J.J.: Computer investigation of cubic graphs. Report 76-WSK-01. Eindhoven: Technological University 1976.
Ellingham, M.N., Holton, D.A., Little, C.H.C.: Cycles through ten vertices in 3-connected cubic graphs. Combinatorica (to appear)
Häggvist, R., Thomassen, C.: Circuits through specified edges. Discrete Math.41, 29–34 (1982)
Holton, D.A., McKay, B.D., Plummer, M.D., Thomassen, C.: A nine point theorem for 3-connected graphs. Combinatorica2, 53–62 (1982)
Holton, D.A., Thomassen, C.: Research problem. Discrete Math. (to appear)
Lovász, L.: Problem 5. Period. Math. Hung4, 82 (1974)
Thomassen, C.: Girth in graphs. J. Comb. Theory (B)35, 129–141 (1983)
Author information
Authors and Affiliations
Additional information
This work was done while Thomassen was a visitor at the University of Melbourne. Support from the University of Melbourne, the Danish “Jubilæ and the Danish Science Research Council is greatfully acknowledged.
Rights and permissions
About this article
Cite this article
Aldred, R.E.L., Holton, D.A. & Thomassen, C. Cycles through four edges in 3-connected cubic graphs. Graphs and Combinatorics 1, 7–11 (1985). https://doi.org/10.1007/BF02582923
Issue Date:
DOI: https://doi.org/10.1007/BF02582923