The square of every two-connected graph is Hamiltonian
- 1 February 1974
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 16 (1) , 29-34
- https://doi.org/10.1016/0095-8956(74)90091-4
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- On spanning subgraphs of a connected bridgeless graph and their application to DT-graphsJournal of Combinatorial Theory, Series B, 1974
- On minimal blocksTransactions of the American Mathematical Society, 1968