Previous |  Up |  Next

Article

References:
[1] M. Behzad, G. Chartrand: Introduction to the Theory of Graphs. Allyn and Bacon, Boston 1971. MR 0432461 | Zbl 0238.05101
[2] J. A. Bondy: Pancyclic Graphs. Congressus Numeratium III. (Proceedings of the Second Louisiana Conference on Combinatorics, Graph Theory and Computing, eds. R. C. Mullin, K. B. Reid, D. P. Roselle and R. S. D. Thomas), Utilitas Mathematica Publishing Inc., Winnipeg 1972, pp. 167-172. MR 0325458
[3] G. Chartrand S. F. Kapoor, D. R. Lick: n-Hamiltonian graphs. J. Combinatorial Theory 9 (1970), 308-312. DOI 10.1016/S0021-9800(70)80069-2 | MR 0276120
[4] F. Harary: Graph Theory. : Addison-Wesley. Reading (Mass.) 1969. MR 0256911
[5] F. Harary, С. St. J. A. Nash-Williams: On eulerian and hamiltonian graphs and line graphs. Canadian Math. Bull. 8 (1965), 701-709. DOI 10.4153/CMB-1965-051-3 | MR 0191839 | Zbl 0136.44704
[6] L. Nebeský: A theorem on hamiltonian line graphs. Comment. Math. Univ. Carolinae 14 (1973), 107-112. MR 0382068
Partner of
EuDML logo