The number of n-cycles in a graph
From MaRDI portal
Publication:879592
Recommendations
Cites work
- scientific article; zbMATH DE number 465171 (Why is no real title available?)
- scientific article; zbMATH DE number 2094523 (Why is no real title available?)
- Inequalities and identities for generalized matrix functions
- The Clar covering polynomial of hexagonal systems with an application to chromatic polynomials
- The Clar covering polynomial of hexagonal systems. I
- The Clar covering polynomial of hexagonal systems. III
Cited in
(15)- An efficient approximation algorithm for counting \(n\)-cycles in a graph
- The number of cycles with a given descent set
- A general purpose algorithm for counting simple cycles and simple paths of any length
- On the Number of Cycles in a Graph with Restricted Cycle Lengths
- The number of edges in a maximum cycle-distributed graph
- Cycle multiplicity of some total graphs
- Number of cycles of small length in a graph
- scientific article; zbMATH DE number 4027500 (Why is no real title available?)
- The number of $4$-cycles and the cyclomatic number of a finite simple graph
- scientific article; zbMATH DE number 5811332 (Why is no real title available?)
- On the number of cliques and cycles in graphs
- A Hopf algebra for counting cycles
- The number of cycles in the square bipartite graphs \(B_{m\times n}\)
- scientific article; zbMATH DE number 6010662 (Why is no real title available?)
- Enumerating simple paths from connected induced subgraphs
This page was built for publication: The number of \(n\)-cycles in a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879592)