Every finite strongly connected digraph of stability 2 has a Hamiltonian path
- 31 December 1983
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 44 (3) , 243-250
- https://doi.org/10.1016/0012-365x(83)90188-7
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- On a characterization of planar graphsBulletin of the Australian Mathematical Society, 1981
- Elegant odd rings and non-planar graphsPublished by Springer Nature ,1981