On Forbidden Pairs Implying Hamilton‐Connectedness
From MaRDI portal
Publication:4916093
DOI10.1002/jgt.21645zbMath1261.05052OpenAlexW1510472264MaRDI QIDQ4916093
Zdeněk Ryjáček, Petr Vrána, Ralph J. Faudree, Jill R. Faudree
Publication date: 19 April 2013
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21645
Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs ⋮ Forbidden pairs and the existence of a spanning Halin subgraph ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected
Cites Work
- Unnamed Item
- Hamiltonicity in claw-free graphs
- Closure and Hamiltonian-connectivity of claw-free graphs
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
- Characterizing forbidden pairs for hamiltonian properties
- Eulerian subgraphs and Hamilton-connected line graphs
- Graphe représentatif des aretes d'un multigraphe
- On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
- An analogue of the Whithey theorem for edge graphs of multigraphs, and edge multigraphs
- Forbidden subgraphs that imply hamiltonian‐connectedness*
- On Eulerian and Hamiltonian Graphs and Line Graphs
