Finding and counting given length cycles

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.

[1]  B. Monien.  How to Find Long Paths Efficiently , 1985 .

[2]  Mihalis Yannakakis,et al.  The Clique Problem for Planar Graphs , 1981, Inf. Process. Lett..

[3]  B. Bollobás,et al.  Extremal Graph Theory , 2013 .

[4]  Svatopluk Poljak,et al.  On the complexity of the subgraph problem , 1985 .

[5]  Dana S. Richards,et al.  Finding Short Cycles in Planar Graphs Using Separators , 1986, J. Algorithms.

[6]  B. Bollobás.  On generalized graphs , 1965 .

[7]  Alon Itai,et al.  Finding a minimum circuit in a graph , 1977, STOC '77.

[8]  Noga Alon,et al.  Color-coding , 1995, JACM.

[9]  Norishige Chiba,et al.  Arboricity and Subgraph Listing Algorithms , 1985, SIAM J. Comput..

[10]  Raphael Yuster,et al.  Finding Even Cycles Even Faster , 1994, SIAM J. Discret. Math..

[11]  Leland L. Beck,et al.  Smallest-last ordering and clustering and graph coloring algorithms , 1983, JACM.

[12]  Frank Harary,et al.  Graph Theory , 2016 .

[13]  Dieter Kratsch,et al.  Finding and Counting Small Induced Subgraphs Efficiently , 1995, WG.

[14]  Steven Skiena,et al.  Recognizing small subgraphs , 1995, Networks.

[15]  Dieter Kratsch,et al.  Finding and Counting Small Induced Subgraphs Efficiently , 1995, WG.

[16]  Noga Alon,et al.  Finding and Counting Given Length Cycles (Extended Abstract) , 1994, ESA.

[17]  Noga Alon,et al.  Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs , 1994, STOC '94.

[18]  David Eppstein,et al.  The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems , 1994, GD.

[19]  M. Simonovits,et al.  Cycles of even length in graphs , 1974 .