Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian

DOI10.1016/J.DAM.2009.05.005zbMath1225.05150OpenAlexW2025717508MaRDI QIDQ968148

Yubao Guo, Sheng-Jia Li, Rui Juan Li

Publication date: 5 May 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.05.005

zbMATH Keywords

distancedegree condition\(k\)-ordered Hamiltonian graphs

Mathematics Subject Classification ID

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

Related Items (4)

2-spanning cyclability problems of some generalized Petersen graphs ⋮ Disjoint cycles in hypercubes with prescribed vertices in each cycle ⋮ Permanental bounds of the Laplacian matrix of trees with given domination number ⋮ A fan-type result on \(k\)-ordered graphs

Cites Work

• Unnamed Item
• Unnamed Item
• An improved linear edge bound for graph linkages
• An efficient condition for a graph to be Hamiltonian
• Onk-ordered Hamiltonian graphs
• Onk-ordered graphs
• Degree conditions for k‐ordered hamiltonian graphs
• k-ordered Hamiltonian graphs
• Survey of results on \(k\)-ordered graphs

This page was built for publication: Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian