An implicit degree condition for relative length of long paths and cycles in graphs

DOI10.1007/S10255-016-0561-1zbMath1336.05071OpenAlexW2344788235MaRDI QIDQ287873

Jun-qing Cai, Hao Li

Publication date: 23 May 2016

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

Full work available at URL: https://doi.org/10.1007/s10255-016-0561-1

zbMATH Keywords

Hamiltonian pathdominating cyclesimplicit degreelongest cycleslongest paths

Mathematics Subject Classification ID

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

Related Items (4)

Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian ⋮ HIGH-ORDER COPOSITIVE TENSORS AND ITS APPLICATIONS ⋮ A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs

Cites Work

• Implicit-degrees and circumferences
• Relative length of long paths and cycles in graphs with large degree sums
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An implicit degree condition for relative length of long paths and cycles in graphs