An algorithm for finding hamiltonian circuits in certain graphs
- 1 January 1978
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Hamiltonian circuits in random graphsDiscrete Mathematics, 1976
- A method in graph theoryDiscrete Mathematics, 1976
- Algorithms for constructing graphs and digraphs with given valences and factorsDiscrete Mathematics, 1973
- On Hamilton's idealsJournal of Combinatorial Theory, Series B, 1972
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. IJournal of the Society for Industrial and Applied Mathematics, 1962
- Some Theorems on Abstract GraphsProceedings of the London Mathematical Society, 1952