scientific article; zbMATH DE number 3419161

Cited in

(only showing first 100 items - show all)

\(e\): the master of all
Exact unprovability results for compound well-quasi-ordered combinatorial classes
Structure of Jackson integrals of \(BC_n\) type
On the parity of the Wiener index
New bijective links on planar maps via orientations
The monoids of orders eight, nine \& ten.
Almost all graphs are rigid-revisited
On an asymptotic evaluation of the cycle index of the symmetric group
Minimal algebras of infinite representation type with preprojective component
On labeled vertex-transitive digraphs with a prime number of vertices
Symbolic calculation of the trace of the power of a tridiagonal matrix
The chromatic polynomial of an unlabeled graph
Isomorphic factorizations VIII: Bisectable trees
Counting labelled chordal graphs
Metric transforms of finite spaces and connected graphs
An analysis of Monte Carlo algorithms for counting problems
The number of trees with a 1-factor
Monotonically labelled Motzkin trees
Redfield's papers and their relevance to counting isomers and isomerizations
Some applications of graph theory to the study of polymer configuration
Binomial-combinatorial properties of Clar structures
A logical approach to asymptotic combinatorics I. First order properties
Survival under random coverings of trees
Some methods for computing component distribution probabilities in relational structures
A note on the number of leftist trees
Enumerating phylogenetic trees with multiple labels
Variations on the Ising problem
On the generalized iterates of Yeh's combinatorial \({\mathbb{K}}\)-species
\(k\)-connectivity in random graphs
Cataloguing general graphs by point and line spectra
The enumeration of connected graphs and linked diagrams
The full cycles in a Young coset
Jordan splittings of almost unimodular integral quadratic forms
Counting non-isomorphic three-connected planar maps
Counting labelled three-connected and homeomorphically irreducible two- connected graphs
Counting unlabelled three-connected and homeomorphically irreducible two- connected graphs
Graph theoretic models
On graphs with given automorphism group
A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
Boolean distance for graphs
Periodic oscillations of coefficients of power series that satisfy functional equations
Generalizations of theorems of Wilson, Fermat and Euler
Une théorie combinatoire des séries formelles
Principle of inclusion-exclusion on partially ordered sets
The enumeration of stack polytopes and simplicial clusters
Galois correspondence between permutation groups and cellular rings (association schemes)
Trees with 1-factors and oriented trees
Automatic average-case analysis of algorithms
Uniform random generation of expressions respecting algebraic identities
Steepest descent method and limiting distributions in combinatorial analysis
The functorial composition of species, a forgotten operation
On asymmetric structures
Card shuffling and a transformation on \(S_ n\)
The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group
Counting asymmetric enriched trees
On the number of labeled acyclic digraphs
On the cell-growth problem for arbitrary polygons
The distribution of degrees in a large random tree
On enumerating paths of K arcs in unoriented complete graphs
Développements recents de la théorie des graphes
Arithmetical properties of finite graphs and polynomials
Connectability and structural controllability of composite systems
An asymptotic evaluation of the cycle index of a symmetric group
Steady state and quasi-equilibrium enzyme models: A comparison of equation types
Classification and enumeration of minimum (d, 3, 3)-graphs for odd d
The exponential generating function of labelled blocks
The maximum number of K_j-subgraphs in a graph with k independent edges
Streng parametrische Bedingungen und die Anzahl ihrer nicht isomorphen Modelle
On The tantalizer and Instant insanity
On the chromatic index of almost all graphs
On general dissections of a polygon
Sulla cardinabilita delle classi di 6-5-grafi
On-line computation of convolutions
Counting Witt rings
Upper bounds on the size of obstructions and intertwines
Enumeration of cubic graphs by inclusion-exclusion
Group theory method for enumeration of outerplanar graphs
Analytic combinatorics of non-crossing configurations
Enumerative aspects of certain subclasses of perfect graphs
Quantifying fault recovery in multiprocessor systems
Permutations with p^ lth roots
Cyclic homology and the determinant of the Cartan matrix
Counting two-dimensional posets
Central and local limit theorems for the coefficients of polynomials associated with the Laguerre ones
Enumeration of unlabelled bicolored graphs by degree parities
Graph-theoretic interpretation of the generalized row sum method
Limiting distributions for the number of distinct component sizes in relational structures
Ramsey numbers \(r(K_ 3,G)\) for connected graphs \(G\) of order seven
Designs for two-level factorial experiments with linear models containing main effects and selected two-factor interactions
Enumeration of finite field labels on graphs
Symmetry groups of Boolean functions and constructions of permutation groups
Polynomial invariants for trees. A statistical mechanics approach
Enumeration of unlabelled graphs with specified degree parities
Chirality measures and graph representations
A characterization of moral transitive acyclic directed graph Markov models as labeled trees.
The Specker-Blatter theorem does not hold for quaternary relations
Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
The asymptotic number of claw-free cubic graphs.
Height counting of unlabeled interval and \(N\)-free posets.
The number of trees half of whose vertices are leaves and asymptotic enumeration of plane real algebraic curves.

This page was built for publication:

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