On \(k\)-ordered graphs involved degree sum

DOI10.1007/S10255-003-0085-3zbMath1029.05092OpenAlexW2045232572MaRDI QIDQ1873586

Feng Tian, Zhi-quan Hu

Publication date: 8 February 2004

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-003-0085-3

zbMATH Keywords

Hamiltonian cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Set-orderedness as a generalization of \(k\)-orderedness and cyclability

Cites Work

• Unnamed Item
• Note on Hamilton Circuits
• Onk-ordered Hamiltonian graphs
• Onk-ordered graphs
• k-ordered Hamiltonian graphs

This page was built for publication: On \(k\)-ordered graphs involved degree sum