The Hamiltonicity of k-connected [s,t]-graphs.

zbMATH Open1349.05202MaRDI QIDQ2804770FDOQ2804770

Authors Jianglu Wang, Lei Mou 

Publication date 4 May 2016

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

\(k\)-connected graphs\([s,t\)-graphs]Hamilton paths (cycles)

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45) Connectivity (05C40)

Recommendations

• Sufficient conditions for some Hamiltonian properties and \(k\)-connectivity of graphs
• Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs
• scientific article; zbMATH DE number 2060786
• On hamiltonian‐connected graphs
• Connectivity and Hamiltonian connectedness of graphs
• Hamiltonicity of connected domination critical graphs.
• Hamiltonicity in connected regular graphs
• Hamiltonicity of \(k\)-traceable graphs
• A sufficient condition for \(s\)-Hamilton-connected graphs
• Hamiltonicity and $\sigma$-hypergraphs

Cited In (7)

• Generalizations of the classics to spanning connectedness
• The property of Hamiltonian connectedness in Toeplitz graphs
• A short proof of a theorem concerning degree sums and connectivity on Hamiltonian graphs
• Toughness, forbidden subgraphs and pancyclicity
• A note on Hamiltonian circuits
• Hamilton cycles in 2-connected \([5,3]\)-graphs
• Title not available (Why is no real title available?)

This page was built for publication: The Hamiltonicity of \(k\)-connected \([s,t]\)-graphs.

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