On the size of graphs whose cycles have length divisible by a fixed integer

zbMATH Open1207.05103MaRDI QIDQ3058992FDOQ3058992

Authors: S. Akbari, M. Jamaali, Ahmad Mahmoody, S. A. Seyed Fakhari 

Publication date: 8 December 2010

Recommendations

• Graphs with a cycle of length divisible by three
• On cycle lengths in graphs of moderate degree
• scientific article; zbMATH DE number 867680
• On the Number of Cycles in a Graph with Restricted Cycle Lengths
• Cycles of length 0 modulo 4 in graphs

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cited In (2)

• On the divisibility of the cycle number by 7
• Packing cycles with modularity constraints

This page was built for publication: On the size of graphs whose cycles have length divisible by a fixed integer

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