A sufficient condition guaranteeing large cycles in graphs

DOI10.1016/S0012-365X(96)00110-0zbMATH Open0876.05055MaRDI QIDQ1357752FDOQ1357752

Authors: Ladislav Stacho 

Publication date: 4 November 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• Cycles in graphs of fixed girth with large size
• Maximal cycles in graphs of large girth
• New sufficient conditions for cycles in graphs
• Long cycles in certain graphs of large degree
• Cycles in graphs with large independence ratio
• A sufficient condition for cyclability in directed graphs
• scientific article; zbMATH DE number 4127255
• A sufficient condition for dominating cycles
• Long cycles in graphs with large degree sums
• Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem

zbMATH Keywords

long cycle

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cites Work

• Large cycles in graphs
• A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness
• Old Hamiltonian Ideas from a New Point of View

Cited In (3)

• Large cycles in generalized Johnson graphs
• New sufficient conditions for cycles in graphs
• Title not available (Why is that?)

This page was built for publication: A sufficient condition guaranteeing large cycles in graphs

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