Funder
Korea government (MSIP and MOE)
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference37 articles.
1. Graph Theory;Bondy,2008
2. Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets;Caha;J. Graph Theory,2006
3. M.-S. Chang, M.-T. Ko, H.-I. Lu, Linear-time algorithms for tree root problems, in: Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT’06, 2006, pp. 411–422.
4. The square of a block is Hamiltonian connected;Chartrand;J. Combin. Theory Ser. B,1974
5. The cube of every connected graph is 1-Hamiltonian;Chartrand;J. Res. Natl. Bur. Stand.,1969
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献