Finding and counting given length cycles

Extended Abstract
  • Noga Alon
  • Raphael Yuster
  • Uri Zwick
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 855)


We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected graphs. Most of the bounds obtained depend solely on the number of edges in the graph in question, and not on the number of vertices. The bounds obtained improve upon various previously known results.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AYZ94]
    N. Alon, R. Yuster, and U. Zwick. Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, Montréal, Canada, pages 326–335, 1994.Google Scholar
  2. [Bol65]
    B. Bollobás. On generalized graphs. Acta Math. Acad. Sci. Hungar., 16:447–452, 1965.MATHMathSciNetGoogle Scholar
  3. [Bol78]
    B. Bollobás. Extremal graph theory. Academic Press, 1978.Google Scholar
  4. [BS74]
    J.A. Bondy and M. Simonovits. Cycles of even length in graphs. Journal of Combinatorial Theory, Series B, 16:97–105, 1974.CrossRefMathSciNetGoogle Scholar
  5. [CN85]
    N. Chiba and L. Nishizeki. Arboricity and subgraph listing algorithms. SIAM Journal on Computing, 14:210–223, 1985.CrossRefMathSciNetGoogle Scholar
  6. [1R78]
    A. Itai and M. Rodeh. Finding a minimum circuit in a graph. SIAM Journal on Computing, 7:413–423, 1978.CrossRefMathSciNetGoogle Scholar
  7. [MB83]
    D.W. Matula and L.L. Beck. Smallest-last ordering and clustering and graph coloring algorithms. Journal of the ACM, 30:417–427, 1983.CrossRefMathSciNetGoogle Scholar
  8. [Mon85]
    B. Monien. How to find long paths efficiently. Annals of Discrete Mathematics, 25:239–254, 1985.MATHMathSciNetGoogle Scholar
  9. [NP85]
    J. Nešetřil and S. Poljak. On the complexity of the subgraph problem. Commentationes Mathematicae Universitatis Carolinae, 26(2):415–419, 1985.MathSciNetGoogle Scholar
  10. [PY81]
    C.H. Papadimitriou and M. Yannakakis. The clique problem for planar graphs. Information Processing Letters, 13:131–133, 1981.CrossRefMathSciNetGoogle Scholar
  11. [Ric86]
    D. Richards. Finding short cycles in a planar graph using separators. Journal of Algorithms, 7:382–394, 1986.CrossRefMATHMathSciNetGoogle Scholar
  12. [YZ94]
    R. Yuster and U. Zwick. Finding even cycles even faster. In Proceedings of the 21st International Colloquium on Automata, Languages and Programming, Jerusalem, Israel, 1994. To appear.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Noga Alon
    • 1
  • Raphael Yuster
    • 1
  • Uri Zwick
    • 1
  1. 1.School of Mathematical SciencesTel Aviv UniversityTel AvivIsrael

Personalised recommendations