Gould, Ronald J.; Jacobson, Michael S. Forbidden subgraphs and Hamiltonian properties and graphs. (English) Zbl 0495.05039 Discrete Math. 42, 189-196 (1982). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 30 Documents MSC: 05C38 Paths and cycles 05C45 Eulerian and Hamiltonian graphs Keywords:homogeneously traceable; pancyclic graph; forbidden subgraphs PDFBibTeX XMLCite \textit{R. J. Gould} and \textit{M. S. Jacobson}, Discrete Math. 42, 189--196 (1982; Zbl 0495.05039) Full Text: DOI References: [1] Behzad, M.; Chartrand, G.; Lesniak-Foster, L., Graphs and Digraphs (1979), Prindle, Weber & Schmidt: Prindle, Weber & Schmidt Boston · Zbl 0403.05027 [2] Chartrand, G.; Gould, R. J.; Kapoor, S. F., On homogeneously traceable nonhamiltonian graphs, Ann. New York Acad. Sci., 319, 130-135 (1979) · Zbl 0481.05039 [3] Duffus, D.; Gould, R. J.; Jacobson, M. S., Forbidden subgraphs and the hamiltonian theme, (Proc. 4th Int. Conf. on the Theory and Applications of Graphs. Proc. 4th Int. Conf. on the Theory and Applications of Graphs, Kalamazoo, 1980 (1981), Wiley: Wiley New York), 297-316 · Zbl 0466.05049 [4] Goodman, S.; Hedetniemi, S., Sufficient conditions for a graph to be hamiltonian, J. Combin. Theory (B), 16, 175-180 (1974) · Zbl 0275.05126 [5] Gould, R. J., Traceability in graphs, (Doctoral Thesis (1979), Western Michigan University) [6] S.V. Kanetkar and P.R. Rao, Connected locally 2-connected, \(K_{1,3}\); S.V. Kanetkar and P.R. Rao, Connected locally 2-connected, \(K_{1,3}\) · Zbl 0546.05039 [7] Oberly, D.; Summer, D., Every connected locally connected nontrivial graph with no induced claw is hamiltonian, J. Graph Theory, 3, 351-356 (1979) · Zbl 0424.05036 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.