The following pages link to (Q3254323):
Displaying 20 items.
- The combinatorics of N. G. de Bruijn (Q740470) (← links)
- Sets with involutions: power group enumeration (Q976166) (← links)
- Enumeration of self-complementary structures (Q1227741) (← links)
- A generalization of Burnside's combinatorial lemma (Q1247969) (← links)
- Necklaces, symmetries and self-reciprocal polynomials (Q1252858) (← links)
- Remarks on umbral evaluations of chromatic polynomials (Q1318843) (← links)
- Principle of inclusion-exclusion on semilattices (Q1846879) (← links)
- On the enumeration of self-complementary m-placed relations (Q1846886) (← links)
- The cyclic sieving phenomenon (Q1881679) (← links)
- N. G. de Bruijn (1918--2012) and his road to Automath, the earliest proof checker (Q1935352) (← links)
- Constructive graph labeling using double cosets (Q2264765) (← links)
- A group algebraic approach to NPN classification of Boolean functions (Q2322710) (← links)
- On the number of classes of (n,k) switching networks (Q2539616) (← links)
- Symmetry operators of Kranz product (Q2547555) (← links)
- Enumeration of mapping patterns (Q2553438) (← links)
- The combinatorial analysis of patterns and the principle of inclusion- exclusion (Q2554328) (← links)
- Enumeration of Reversible Functions and Its Application to Circuit Complexity (Q3186605) (← links)
- The Number of Isomorphism Types of Finite Algebras (Q5520677) (← links)
- On the foundations of combinatorial theory I. Theory of M�bius Functions (Q5731810) (← links)
- Enumeration of bipartite self-complementary graphs (Q5895187) (← links)
