Pages that link to "Item:Q801080"
From MaRDI portal
The following pages link to An invariant theory approach to graph enumeration (Q801080):
Displaying 17 items.
- Order polynomials and Pólya's enumeration theorem. (Q405267) (← links)
- Graph invariants and large cycles: a survey (Q539347) (← links)
- Enumeration of connected invariant graphs (Q788743) (← links)
- A computational approach to construct a multivariate complete graph invariant (Q903598) (← links)
- The chromatic polynomial of an unlabeled graph (Q1059638) (← links)
- The \(k\)-orbit reconstruction and the orbit algebra (Q1201909) (← links)
- Graph theory and classical invariant theory (Q1263642) (← links)
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers (Q1406039) (← links)
- Injective envelope of graphs and transition systems (Q1584442) (← links)
- Polynomial invariants on matrices and partition, Brauer algebras (Q1998954) (← links)
- A new formula for the generating function of the numbers of simple graphs (Q2822180) (← links)
- On Operator and Formal Sum Methods for Graph Enumeration Problems (Q3342592) (← links)
- Graphentheoretische Ermittlung der Anzahl von strukturellen und streng strukturellen Invarianten Nullstellen / Graph-theoretical determination of the number of structural and strictly structural invariant zeros (Q3743208) (← links)
- Applications of multlinear algebra (Q4015394) (← links)
- (Q4232805) (← links)
- The shrinking-and-expanding method for the graph enumeration (Q4522762) (← links)
- (Q4793752) (← links)
