Chartrand, G.; Hobbs, Arthur M.; Jung, H. A.; Kapoor, S. F.; Nash-Williams, C. St. J. A. The square of a block is Hamiltonian connected. (English) Zbl 0277.05129 J. Comb. Theory, Ser. B 16, 290-292 (1974). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 25 Documents MSC: 05C35 Extremal problems in graph theory PDFBibTeX XMLCite \textit{G. Chartrand} et al., J. Comb. Theory, Ser. B 16, 290--292 (1974; Zbl 0277.05129) Full Text: DOI References: [1] Chartrand, G.; Kapoor, S. F.; Lick, D. R., \(n\)-Hamiltonian graphs, J. Combinatorial Theory, 9, 308-312 (1970) · Zbl 0204.57005 [2] Fleischner, H., On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs, J. Combinatorial Theory Series B, 16, 17-28 (1974) · Zbl 0256.05120 [3] Fleischner, H., The square of every two-connected graph is Hamiltonian, J. Combinatorial Theory Series B, 16, 29-34 (1974) · Zbl 0256.05121 [4] Harary, F., (Graph Theory (1969), Addison-Wesley: Addison-Wesley Reading, Mass) · Zbl 0182.57702 [5] Ore, O., Hamiltonian connected graphs, J. Math. Pures Appl., 42, 21-27 (1963) · Zbl 0106.37103 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.