Author:
Aldred R. E. L.,Holton D. A.
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference9 articles.
1. Aldred, R.E.L., Holton, D.A., Thomassen, C.: Cycles through four edges in 3-connected cubic graphs. Graphs and Combinatorics1, 1–5 (1985)
2. Bussemaker, F.C., Cobeljic, S., Cvetkovic, D.M., Seidel, J.J.: Computer investigation of cubic graphs. Report 76-WSK-01. Eindhoven: Technological University 1976
3. Ellingham, M.N.: Cycles in 3-connected cubic graphs. M. Sc. Thesis. University of Melbourne 1982
4. Ellingham, M.N., Holton, D.A., Little, C.H.C.: Cycles through ten vertices in 3-connected cubic graphs. Combinatorica4, 256–273 (1984)
5. Häggvist, R., Thomassen, C.: Circuits through specified edges. Discrete Math.41, 29–34 (1982)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Circumference of 3-connected cubic graphs;Journal of Combinatorial Theory, Series B;2018-01
2. Theo Thole and the graphical methods;Journal of Electron Spectroscopy and Related Phenomena;1997-08
3. Cycles through edges in cyclically k –connected cubic graphs;Discrete Mathematics;1992-05