Graphs in which every finite path is contained in a circuit
- 1 March 1973
- journal article
- research article
- Published by Springer Nature in Mathematische Annalen
- Vol. 203 (1) , 65-75
- https://doi.org/10.1007/bf01349245
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- On randomly Hamiltonian graphsMathematische Annalen, 1973
- On Arbitrarily Traceable Graphs.MATHEMATICA SCANDINAVICA, 1972
- Randomly Traceable GraphsSIAM Journal on Applied Mathematics, 1968
- Decomposition of Graphs Into Closed and Endless ChainsProceedings of the London Mathematical Society, 1960