Publication:5682013
From MaRDI portal
zbMath0266.05108MaRDI QIDQ5682013
Publication date: 1973
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
05C30: Enumeration in graph theory
Related Items
Gaussian limiting distributions for the number of components in combinatorial structures, Matchings in benzene chains, The complexity of computing the permanent, A theory of even functionals and their algorithmic applications, General combinatorial schemas: Gaussian limit distributions and exponential tails, Balancing the \(n\)-cube: A census of colorings, On the symmetry and asymmetry of combinatorial structures, Self-similarity in the combinatorial theory of orthogonal polynomials, The specification of 2-trees, Enumeration of connected graphs with cut vertices, The enumeration of bipartite graphs, On the number of trees in a random forest, Mean characteristics of Gibbsian point processes, The characters of the wreath product group acting on the homology groups of the Dowling lattices, On the average shape of monotonically labelled tree structures, Enumeration of connected invariant graphs, Counting and coding identity trees with fixed diameter and bounded degree, Matchings in pentagonal chains, Points by degree and orbit size in chemical trees. II, On the succinct representation of graphs, An invariant theory approach to graph enumeration, An investigation of Runge-Kutta processes, and equivalence of scalar and vector cases, An asymptotic expansion for the coefficients of some power series. II: Lagrange inversion, Classification of small (0, 1) matrices, Reconstructing graphs from cut-set sizes, The first cycles in an evolving graph, Periodic solutions for the Schrödinger equation with nonlocal smoothing nonlinearities in higher dimension, \(e\): the master of all, Exact unprovability results for compound well-quasi-ordered combinatorial classes, 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, Unnamed Item, All Circuits Enumeration in Macro-Econometric Models, Random 2-XORSAT at the Satisfiability Threshold, The Monoids of Order Eight and Nine, On the combinatorics of leftist trees, On the number of unique subgraphs of a graph, Asymptotic formulas for the number of oriented graphs, Categorical aspects of generating functions. I: Exponential formulas and Krull-Schmidt categories, Enumeration of hypergraphs, Renormalization group for one-dimensional fermions. A review on mathematical results, Almost every graph has a fixed edge, Packing and Covering Constants for Certain Families of Trees. II, Counting finite models, One-sided variations on interval trees, A Class of Matrices Connected with Volterra Prey-Predator Equations, Enumerative aspects of certain subclasses of perfect graphs, Quantifying fault recovery in multiprocessor systems, Permutations with \(p^ l\)th 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., An evolutionary approach for finding optimal trees in undirected networks, The enumeration of self-complementary \(k\)-multigraphs, Counting structures in the Möbius ladder, When a digraph and its line digraph are connected and cospectral, The enumeration of labeled graphs by number of cutpoints, Generalized binomial coefficients for molecular species, Deformations of Coxeter hyperplane arrangements, Enumeration of \(m\)-ary cacti, Primitivity of permutation groups, coherent algebras and matrices, Priors on network structures. Biasing the search for Bayesian networks, Patchworks and metablocks enumeration, Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width, On oriented 2-factorable graphs, Partitions and permutations, Efficient enumeration of sensed planar maps, Periodic solutions for completely resonant nonlinear wave equations with Dirichlet boundary conditions, Asymptotic number of symmetries in locally restricted trees, The asymptotic behaviour of coefficients of powers of certain generating functions, Graph theory, \(SO(n)\) current algebra and the Virasoro master equation, On an asymptotic method in enumeration, Labelled and unlabelled enumeration of \(k\)-gonal 2-trees, Counting bridgeless graphs, Hereditarily finite sets and identity trees, On monotone functions of tree structures, On the number of phenotype structures in genetic systems, Computers and discovery in algebraic graph theory, On a reconstruction problem of Harary and Manvel, Forbidden subgraphs in connected graphs, A classification of plane and planar 2-trees, Construction of periodic solutions of nonlinear wave equations with Dirichlet boundary conditions by the Lindstedt series method, The number of \(m\)-Husimi trees fixed by a permutation of the vertices, Enumerative applications of a decomposition for graphs and digraphs, Irrational conformal field theory, Generation of molecular graphs based on flexible utilization of the available structural information, Analytic methods in asymptotic enumeration, The enumeration of trees with and without given limbs, Enumeration of (uni- or bicolored) plane trees according to their degree distribution, An exponential formula for polynomial vector fields. II: Lie series, exponential substitution, and rooted trees, A note on labeled symmetric graphs, Succinct representation of general unlabeled graphs, Graphs, partitions and Fibonacci numbers, Sphericities of double cosets, double coset representations, and Fujita's proligand method for combinatorial enumeration of stereoisomers, Enumeration of algebras close to absolutely free algebras and binary trees, Enumeration and 3D representation of the stereo-isomers of alkane molecules, An analysis of neighborhood functions on generic solution spaces, Counting labeled general cubic graphs, Enumeration and generation with a string automata representation, Counting labeled claw-free cubic graphs by connectivity, The number of caterpillars, On the number of \(n\)-plexes, Forcing bonds of a benzenoid system, Enumeration of solid 2-trees according to edge number and edge degree distribution, Principles of cost minimisation in wireless networks, Efficient dominating sets in labeled rooted oriented trees, Generating effective symmetry-breaking predicates for search problems, Unnamed Item, Unnamed Item, An Application of Polya's Enumeration Theorem to Partitions of Subsets of Positive Integers, Multinomial permutations on a circle, Random cubic planar graphs, Tomography on Finite Graphs, Almost all graphs are rigid - Revisited, Enumeration of Hamiltonian Cycles and Paths in a Graph, A Uniform Approach Towards Succinct Representation of Trees, Tensors and Graphs, Some useful preservation theorems, Unnamed Item, Counting Interval Graphs, Hypergraphs, characteristic polynomials and permutation characters, A Random Graph With a Subcritical Number of Edges, Global asymptotic stability for a class of many-variable volterra prey-predator systems, On the Order of Random Channel Networks, Unnamed Item, Unnamed Item
