The Use of S-Functions in Combinatorial Analysis

Cited in

(32)

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

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)