Tough graphs and hamiltonian circuits
- 1 July 1973
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 5 (3) , 215-228
- https://doi.org/10.1016/0012-365x(73)90138-6
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A note on Hamiltonian circuitsPublished by Elsevier ,2002
- On Hamilton's idealsJournal of Combinatorial Theory, Series B, 1972
- Cycles and Connectivity in GraphsCanadian Journal of Mathematics, 1967
- Existence of k-edge connected ordinary graphs with prescribed degreesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1964
- Graphs and subgraphsTransactions of the American Mathematical Society, 1957
- A theorem on planar graphsTransactions of the American Mathematical Society, 1956
- A Short Proof of the Factor Theorem for Finite GraphsCanadian Journal of Mathematics, 1954
- Some Theorems on Abstract GraphsProceedings of the London Mathematical Society, 1952
- On colouring the nodes of a networkMathematical Proceedings of the Cambridge Philosophical Society, 1941
- Congruent Graphs and the Connectivity of GraphsAmerican Journal of Mathematics, 1932