Forbidden subgraphs that imply hamiltonian-connectedness - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Hajo Broersma, Ralph J. Faudree, Andreas Huck, Huib Trommel, Henk Jan Veldman. Forbidden subgraphs that imply hamiltonian-connectedness. Journal of Graph Theory, 40(2):104-119, 2002. [doi]

The following publications are possibly variants of this publication:

Forbidden subgraphs that imply 2-factorsJill R. Faudree, Ralph J. Faudree, Zdenek Ryjácek. DM, 308(9):1571-1582, 2008. [doi]

Forbidden subgraphs that imply k-ordered and k-ordered hamiltonianJill R. Faudree, Ralph J. Faudree. DM, 243(1-3):91-108, 2002. [doi]

Toughness, forbidden subgraphs, and Hamiltonian-connected graphsWei Zheng 0008, Hajo Broersma, Ligong Wang 0001. dmgt, 42(1):187-196, 2022. [doi]

On Forbidden Pairs Implying Hamilton-ConnectednessJill R. Faudree, Ralph J. Faudree, Zdenek Ryjácek, Petr Vrána. jgt, 72(3):327-345, 2013. [doi]

Characterizing forbidden clawless triples implying hamiltonian graphsRalph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak. DM, 249(1-3):71-81, 2002. [doi]

runs on WebDSL