Funder
Fonds Wetenschappelijk Onderzoek
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference6 articles.
1. Aldred, R.E.L., McKay, B.D., Wormald, N.C.: Small hypohamiltonian graphs. J. Combin. Math. Combin. Comput. 23, 143–152 (1997)
2. Shabbir, A., Zamfirescu, C.T., Zamfirescu, T.I.: Intersecting longest paths and longest cycles: a survey. Electron. J. Graph Theory Appl. 1, 56–76 (2013)
3. Thomassen, C.: Hypohamiltonian graphs and digraphs. In: Proc. Internat. Conf. Theory and Appl. of Graphs, Kalamazoo, 1976, LNCS 642, Springer, Berlin 557–571 (1978)
4. van Aardt, S.A., Burger, A.P., Dunbar, J.E., Frick, M., Llano, B., Thomassen, C., Zuazua, R.: Destroying longest cycles in graphs and digraphs. Discrete Appl. Math. 186, 251–259 (2015)
5. Zamfirescu, C.T.: On non-hamiltonian graphs for which every vertex-deleted subgraph is traceable. J. Graph Theory 86, 223–243 (2017)