The square of a block is Hamiltonian connected
- 1 June 1974
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 16 (3) , 290-292
- https://doi.org/10.1016/0095-8956(74)90075-6
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- The square of every two-connected graph is HamiltonianJournal of Combinatorial Theory, Series B, 1974
- On spanning subgraphs of a connected bridgeless graph and their application to DT-graphsJournal of Combinatorial Theory, Series B, 1974
- n-Hamiltonian graphsJournal of Combinatorial Theory, 1970