Number of cycles of small length in a graph
From MaRDI portal
Publication:6063171
DOI10.1080/09728600.2023.2234421zbMath1523.05019OpenAlexW4385064978MaRDI QIDQ6063171
Publication date: 7 November 2023
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09728600.2023.2234421
Enumeration in graph theory (05C30) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding and counting given length cycles
- A table of connected graphs on six vertices
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- Algorithms to count paths and cycles
- A general purpose algorithm for counting simple cycles and simple paths of any length
- Faster Algebraic Algorithms for Path and Packing Problems
- An algorithm for counting short cycles in bipartite graphs
- Counting Paths and Packings in Halves
- On Short Cycle Enumeration in Biregular Bipartite Graphs
- On Computing the Multiplicity of Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph
- On the Girth of Quasi-Cyclic Protograph LDPC Codes
This page was built for publication: Number of cycles of small length in a graph
