Hamiltonian extendable graphs

DOI10.7151/dmgt.2308zbMath1496.05093OpenAlexW3009817388MaRDI QIDQ2151217

Xiaojing Yang, Limning Xiong

Publication date: 1 July 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2308

zbMATH Keywords

forbidden subgraphHamiltonian extendable

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Hamilton paths in generalized Petersen graphs
• 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected
• Hamilton connected graphs
• On the Hamilton connectivity of generalized Petersen graphs
• Hamiltonicity in claw-free graphs
• Extending matchings in graphs: A survey
• Characterizing forbidden pairs for hamiltonian properties
• Minimal graphs for matching extensions
• Minimal graphs for 2-factor extension
• A note on Hamiltonian circuits
• Forbidden subgraphs that imply hamiltonian‐connectedness*
• On a Problem of Ore
• Generalization of matching extensions in graphs

This page was built for publication: Hamiltonian extendable graphs