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

DOI10.1016/J.DAM.2009.05.005MaRDI QIDQ968148zbMATH OpenOpenAlexFDO

Authors Yubao Guo, Ruijuan Li, Shengjia 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

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

Recommendations

• A fan-type result on \(k\)-ordered graphs
• Onk-ordered Hamiltonian graphs
• Degree conditions for k‐ordered hamiltonian graphs
• Onk-ordered graphs
• k-ordered Hamiltonian graphs

Cites work

• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 1055145 (Why is no real title available?)
• An efficient condition for a graph to be Hamiltonian
• An improved linear edge bound for graph linkages
• Degree conditions for k‐ordered hamiltonian graphs
• Onk-ordered Hamiltonian graphs
• Onk-ordered graphs
• Survey of results on \(k\)-ordered graphs
• k-ordered Hamiltonian graphs

Cited in

(5)

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

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

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