Author:
Beineke Lowell W.,Bagga Jay S.
Publisher
Springer International Publishing
Reference27 articles.
1. A.A. Bertossi, The edge hamiltonian path problem is NP-complete. Inform. Process. Lett. 13, 157–159 (1981)
2. J.A. Bondy, V. Chvátal, A method in graph theory. Discret. Math. 15, 111–135 (1976)
3. H.J. Broersma, Z. Ryjáček, P. Vrána, How many conjectures can you stand? A survey. Graphs Combin. 30, 501–510 (2014)
4. G. Chartrand, Graphs and their associated line-graphs, Ph.D. thesis. Michigan State University (1964)
5. G. Chartrand, On hamiltonian line-graphs. Trans. Amer. Math. Soc. 134, 559–566 (1968)