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

DOI10.1007/S10255-016-0561-1zbMATH Open1336.05071OpenAlexW2344788235MaRDI QIDQ287873FDOQ287873

Authors: Junqing 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

Recommendations

• scientific article; zbMATH DE number 6770098
• On implicit degree sum condition for long cycles.
• Implicit degree sum condition for Hamiltonian cycles.
• An implicit degree condition for long cycles in 2-connected graphs
• A sufficient condition involving implicit degree and neighborhood intersection for long cycles

zbMATH Keywords

Hamiltonian pathdominating cyclesimplicit degreelongest cycleslongest paths

Mathematics Subject Classification ID

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

Cites Work

• Graph theory with applications
• Title not available (Why is that?)
• Relative length of long paths and cycles in graphs with large degree sums
• Title not available (Why is that?)
• Implicit-degrees and circumferences

Cited In (8)

• On implicit degree sum condition for long cycles.
• An implicit degree condition for long cycles in 2-connected graphs
• A sufficient condition involving implicit degree and neighborhood intersection for long cycles
• High-order copositive tensors and its applications
• An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian
• A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
• Core and Conditional Core Path of Specified Length in Special Classes of Graphs

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

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