Request a copy

Full Text

• Asano, T., Exoo, G., Harary, F., Saito, N., The smallest 2-connected cubic bipartite planar nonhamiltonian graph. Discrete Math. 38 (1982), 1–6.
• Barnette, D.W., Conjecture 5. Tutte, W.T., (eds.) Recent Progress in Combinatorics Proc. 3rd Waterloo Conf. Combinatorics, vol. 3, 1969, 343.
• Bondy, J.A., Murty, U.S.R., Graph Theory with Applications. 1976, Macmillan, London.
• Bosák, J., Hamiltonian lines in cubic graphs. Proc. of International Seminar on Graph Theory and Applications, 1966, 33–46.
• Boyd, S., Sitters, R., van der Ster, S., Stougie, L., The traveling salesman problem on cubic and subcubic graphs. Math. Program. Ser. A 144 (2014), 227–245.
• Brinkmann, G., Goedgebeur, J., McKay, B.D., Generation of Cubic graphs. Discrete Math. Theor. Comput. Sci. 13:2 (2011), 69–80.
• Exoo, G., Harary, F., The smallest cubic multigraphs with prescribed bipartite, block, hamiltonian and planar properties. Indian J. Pure Appl. Math. 13 (1982), 309–312.
• Goodey, P.R., A class of Hamiltonian polytopes. J. Graph Theory 1 (1977), 181–185.
• Grünbaum, B., Convex Polytopes. 1967, John Wiley and Sons, New York.
• Holton, D.A., McKay, B.D., The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices. J. Combin. Theory Ser. B 45 (1988), 315–319.
• F. Kardos, A computer-assisted proof of Barnette-Goodey conjecture: Not only fullerene graphs are Hamiltonian, arXiv:1409.2440.
• Knorr, P., Aufspannende Kreise und Wege in Polytopalen Graphen. (Ph.D. thesis), 2010, Universität Dortmund (In German.).
• J. Lederberg, Systematics of organic molecules, graph theory and Hamiltonian circuits, Instrumentation Research Laboratory Report, no. 1040, Stanford University, Stanford, Calif. 1144 (1966).
• Magnant, C., Martin, D.M., A note on the path cover number of regular graphs. Australas. J. Combin. 43 (2009), 211–217.
• Mayeda, W., Seshu, S., Generation of trees without duplications. IEEE Trans. Circuit Theory 12:2 (1965), 181–185.
• McKay, B.D., Piperno, A., Practical graph isomorphism, II. J. Symbolic Comput. 60 (2014), 94–112.
• Mömke, T., Svensson, O., Approximating graphic TSP by matchings. Proc. of the 52nd Symposium FOCS, 2011, 560–569.
• Reed, B., Paths, stars, and the number three. Combin. Probab. Comput. 5 (1996), 277–295.
• Salamon, G., Wiener, G., On spanning trees with few leaves. Inf. Process. Lett. 105 (2008), 164–169.
• Tutte, W.T., On hamiltonian circuits. J. Lond. Math. Soc. 21 (1946), 98–101.
• Tutte, W.T., On the 2-factors of bicubic graphs. Discrete Math. 1 (1971), 203–208.
• Wiener, G., On non-traceable, non-hypotraceable, arachnoid graphs. Electron. Notes Discrete Math. 49 (2015), 621–627.
• Wiener, G., Leaf-critical and leaf-stable graphs. J. Graph Theory 84 (2017), 443–459.
• Yu, G., Covering 2-connected 3-regular graphs with disjoint paths. J. Graph Theory 88 (2018), 385–401.
• Zamfirescu, T., Three small cubic graphs with interesting Hamiltonian properties. J. Graph Theory 4 (1980), 287–292.
• Zoeram, H.G., Yaqubi, D., Spanning k-ended trees of 3-regular connected graphs. Electron. J. Graph Theory Appl. 5 (2017), 207–211.