A HAMILTONIAN CONNECTIVITY PROPERTY OF REGULAR GRAPHS WITH FORBIDDEN SUBGRAPHS

DOI10.1093/QMATH/35.4.507MaRDI QIDQ3220628zbMATH OpenOpenAlexFDO

Authors Ioan Tomescu

Publication date 1984

Published in The Quarterly Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/qmath/35.4.507

zbMATH Keywords

Hamiltonian cyclesregular graphs

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Forbidden subgraphs that imply hamiltonian‐connectedness*
• scientific article; zbMATH DE number 1496417
• scientific article; zbMATH DE number 1210918
• Forbidden subgraphs and hamiitonian properties in the square of a connected graph
• Forbidden subgraphs of graphs uniquely Hamiltonian-connected from a vertex
• scientific article; zbMATH DE number 1161242
• Hamiltonicity and forbidden subgraphs in 4‐connected graphs
• scientific article; zbMATH DE number 1161312
• Hamiltonicity in connected regular graphs
• Forbidden subgraphs, stability and hamiltonicity

Cited in

(2)

• Forbidden subgraphs that imply hamiltonian‐connectedness*
• On regular 2-connected 2-path Hamiltonian graphs

This page was built for publication: A HAMILTONIAN CONNECTIVITY PROPERTY OF REGULAR GRAPHS WITH FORBIDDEN SUBGRAPHS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3220628)