The Use of S-Functions in Combinatorial Analysis

Cited in

(32)

Redfield's papers and their relevance to counting isomers and isomerizations
Manifestations of Polya's counting theorem
The number of symmetric nonnegative integral matrices with prescribed row sums
Young diagrams, Schur functions, the Gale-Ryser theorem and a conjecture or Snapper
Combinatorial problems in the theory of music
Four correspondences between graphs and generalized Young tableaux
The combinatorial analysis of patterns and the principle of inclusion- exclusion
Chromatic uniqueness and equivalence ofK4 homeomorphs
Cutpoints and the chromatic polynomial
Quantum field theory meets Hopf algebra
Chromaticity of two-trees
Onq-trees
On 3-colorings of bipartitep-threshold graphs
A Formal Calculus for the Enumerative System of Sequences-I. Combinatorial Theorems
A Formal Calculus for the Enumerative System of Sequences-II. Applications
A Formal Calculus for the Enumerative System of Sequences-III. Further Developments
Counting the 10-point graphs by partition
Linear and Multilinear Aspects of Isomorph Rejection
Binomial Enumeration on Dissects
On the number of cycles of lengthk in a maximal planar graph
Classification of chromatically unique graphs having quadratic σ‐polynomials
Unit subduced cycle indices for combinatorial enumeration
Universality of iterated networks
A note on chromatic uniqueness of graphs
Network reliability and the factoring theorem
On multigraphs with a given partition
Theory and Application of Plane Partitions: Part 1
Theory and Application of Plane Partitions. Part 2
Combinatorial S-function method for relativistic spinor states of 5g-row dimers: (E-121)_2 to (E-137)_2
Adams operations and -operations in -rings
Redfield's proofs of MacMahon's conjecture
Symmetric functions and P-recursiveness

This page was built for publication: The Use of S-Functions in Combinatorial Analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5551496)