A sufficient condition involving implicit degree and neighborhood intersection for long cycles

DOI10.1016/j.ipl.2014.09.015zbMath1304.05080OpenAlexW1978196385MaRDI QIDQ477634

Jun-qing Cai

Publication date: 9 December 2014

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

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

zbMATH Keywords

combinatorial problemslong cycleimplicit degreeinduced clawinduced modified claw

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40) Vertex degrees (05C07)

Related Items

Degree sum conditions on two disjoint cycles in graphs, Analyzing lattice networks through substructures, Vertex-based and edge-based centroids of graphs

Cites Work

• Unnamed Item
• New sufficient conditions for cycles in graphs
• Implicit-degrees and circumferences
• An implicit degree condition for long cycles in 2-connected graphs
• A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness
• Large cycles in graphs
• A long cycle theorem involving Fan-type degree condition and neighborhood intersection