The following pages link to Enumeration of \(m\)-ary cacti (Q1585488):
Displaying 19 items.
- Enumeration of Möbius type cyclic polyazulenoids (Q511892) (← links)
- Memory efficient algorithms for cactus graphs and block graphs (Q528335) (← links)
- Enumerations, forbidden subgraph characterizations, and the split-decomposition (Q668013) (← links)
- Enumeration of planar constellations (Q1578973) (← links)
- Counting unrooted loopless planar maps (Q1775030) (← links)
- The Grassmann-Berezin calculus and theorems of the matrix-tree type (Q1883393) (← links)
- Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti (Q1885017) (← links)
- Zeroth-order general Randić index of cactus graphs (Q2293835) (← links)
- Weak separation, positivity and extremal Yangian invariants (Q2332240) (← links)
- Local and global degree profiles of randomly grown self-similar hooking networks under uniform and preferential attachment (Q2334518) (← links)
- Counting trees using symmetries (Q2434888) (← links)
- Enumeration of solid 2-trees according to edge number and edge degree distribution (Q2566279) (← links)
- Spanning forests and the \(q\)-state Potts model in the limit \(q \to 0\) (Q2574168) (← links)
- On a conjecture for the signless Laplacian spectral radius of cacti with given matching number (Q2961481) (← links)
- Decomposition numbers for finite Coxeter groups and generalised non-crossing partitions (Q3559038) (← links)
- On the spectral radius of cacti with<i>k</i>-pendant vertices (Q3564202) (← links)
- (Q4644334) (← links)
- The mathematical life of Pierre Leroux (Q5054891) (← links)
- Refined enumeration of vertices among all rooted ordered $d$-trees (Q5242387) (← links)
