A fan-type result on k-ordered graphs

DOI10.1016/J.IPL.2010.05.017zbMATH Open1233.05130OpenAlexW2088708614MaRDI QIDQ765506FDOQ765506

Authors: Ruijuan Li 

Publication date: 19 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.05.017

Recommendations

• On \(k\)-ordered graphs involved degree sum
• k-ordered Hamiltonian graphs
• scientific article; zbMATH DE number 5036076
• Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian
• Degree conditions for k‐ordered hamiltonian graphs

zbMATH Keywords

combinatorial problemsdegree sum condition\(k\)-linked\(k\)-ordered graphs\(k\)-ordered hamiltonian

Mathematics Subject Classification ID

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

Cites Work

• Degree conditions for k‐ordered hamiltonian graphs
• New sufficient conditions for cycles in graphs
• An improved linear edge bound for graph linkages
• Survey of results on \(k\)-ordered graphs
• Title not available (Why is that?)
• On Sufficient Degree Conditions for a Graph to be $k$-linked
• Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian

Cited In (6)

• A Fan-type degree condition for \(k\)-linked graphs
• A study on thek-ordered hamiltonian graphs
• On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem
• Degree sum condition for \(k\)-ordered Hamiltonian connected graphs
• Generalizing vertex pancyclic and \(k\)-ordered graphs
• Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian

This page was built for publication: A fan-type result on \(k\)-ordered graphs

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