Degree sum condition for \(k\)-ordered Hamiltonian connected graphs

DOI10.1007/S00373-013-1393-XzbMath1312.05073OpenAlexW2056992916MaRDI QIDQ2345538

Emlee W. Nicholson, Bing Wei

Publication date: 22 May 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1393-x

zbMATH Keywords

long paths\(k\)-ordered connected\(k\)-ordered Hamiltonian connected\(k\)-ordered sets

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Hamilton connected graphs
• On \(k\)-ordered bipartite graphs
• Note on Hamilton Circuits
• Degree conditions for k‐ordered hamiltonian graphs
• k-ordered Hamiltonian graphs
• Some Theorems on Abstract Graphs

This page was built for publication: Degree sum condition for \(k\)-ordered Hamiltonian connected graphs