Author:
Klocker Benedikt,Fleischner Herbert,Raidl Günther R.
Publisher
Springer International Publishing
Reference22 articles.
1. Abbasi, S., Jamshed, A.: A degree constraint for uniquely Hamiltonian graphs. Graphs and Combinatorics 22(4), 433–442 (2006)
2. Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2011)
3. Bevc, S., Savnik, I.: Using tries for subset and superset queries. In: Proceedings of the ITI 2009, pp. 147–152 (2009)
4. Bondy, J.A., Jackson, B.: Vertices of small degree in uniquely Hamiltonian Graphs. J. Comb. Theory Ser. B 74(2), 265–275 (1998)
5. Caporossi, G., Hansen, P.: Variable neighborhood search for extremal graphs: 1 The AutoGraphiX system. Discrete Math. 212(1–2), 29–44 (2000)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献