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.
- Graph algorithms
ASJC Scopus subject areas
- Computer Science (all)
- Computer Science Applications
- Applied Mathematics