scientific article; zbMATH DE number 3419161
From MaRDI portal
Publication:5682013
zbMath0266.05108MaRDI QIDQ5682013
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Enumeration in graph theory (05C30)
Related Items (only showing first 100 items - show all)
Classification of small (0, 1) matrices ⋮ Counting ordered graphs that avoid certain subgraphs ⋮ An analysis of Monte Carlo algorithms for counting problems ⋮ Analytical expressions for Wiener indices of \(n\)-circumscribed peri-condensed benzenoid graphs ⋮ The number of trees with a 1-factor ⋮ On isomorphisms of Marušič-Scapellato graphs ⋮ Monotonically labelled Motzkin trees ⋮ An asymptotic analysis of labeled and unlabeled \(k\)-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 ⋮ On strongly asymmetric and controllable primitive graphs ⋮ A note on the number of leftist trees ⋮ Enumerating phylogenetic trees with multiple labels ⋮ Variations on the Ising problem ⋮ Matchings in benzene chains ⋮ On the generalized iterates of Yeh's combinatorial \({\mathbb{K}}\)-species ⋮ \(k\)-connectivity in random graphs ⋮ The complexity of computing the permanent ⋮ Birth and growth of multicyclic components in random hypergraphs ⋮ Cataloguing general graphs by point and line spectra ⋮ Asymptotic enumeration of extensional acyclic digraphs ⋮ The enumeration of connected graphs and linked diagrams ⋮ The asymptotic number of non-isomorphic rooted trees obtained by rooting a tree ⋮ A generalization of de Bruijn graphs and classification of endomorphisms of Cuntz algebras by graph invariants ⋮ Enumeration of point-determining graphs ⋮ Certificates for properties of stability polynomials of graphs ⋮ Enumeration of bipartite graphs and bipartite blocks ⋮ The full cycles in a Young coset ⋮ A study of the dynamics of multi-player games on small networks using territorial interactions ⋮ Jordan splittings of almost unimodular integral quadratic forms ⋮ On the Wiener index of random trees ⋮ 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 ⋮ Reconstructing graphs from cut-set sizes ⋮ The first cycles in an evolving graph ⋮ Unprovability threshold for the planar graph minor theorem ⋮ The degree profile of random Pólya trees ⋮ Boolean distance for graphs ⋮ Roots of Ehrhart polynomials arising from graphs ⋮ Periodic oscillations of coefficients of power series that satisfy functional equations ⋮ Relations among tautological classes revisited ⋮ Enumerating stereo-isomers of tree-like polyinositols ⋮ Counting glycans revisited ⋮ Enumerations, forbidden subgraph characterizations, and the split-decomposition ⋮ A theory of even functionals and their algorithmic applications ⋮ Nested wreath groups and their applications to phylogeny in biology and Cayley trees in chemistry and physics ⋮ Code for polyomino and computer search of isospectral polyominoes ⋮ 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 ⋮ Periodic solutions for the Schrödinger equation with nonlocal smoothing nonlinearities in higher dimension ⋮ The specification of 2-trees ⋮ The inverse problem for certain tree parameters ⋮ Matrix integrals and map enumeration: an accessible introduction ⋮ Enumeration of connected graphs with cut vertices ⋮ Chain hexagonal cacti: matchings and independent sets ⋮ The asymptotic value of the Randić index for trees ⋮ Dynamic resource location with tropical algebra ⋮ Sets with involutions: power group enumeration ⋮ Alternating quaternary algebra structures on irreducible representations of \(\mathfrak{sl}_2(\mathbb C)\) ⋮ Gaussian limiting distributions for the number of components in combinatorial structures ⋮ \(e\): the master of all ⋮ Is hyper-extensionality preservable under deletions of graph elements? ⋮ Exact unprovability results for compound well-quasi-ordered combinatorial classes ⋮ Structure of Jackson integrals of \(BC_n\) type ⋮ The enumeration of bipartite graphs ⋮ On the number of trees in a random forest ⋮ Mean characteristics of Gibbsian point processes ⋮ On the parity of the Wiener index ⋮ The characters of the wreath product group acting on the homology groups of the Dowling lattices ⋮ New bijective links on planar maps via orientations ⋮ The monoids of orders eight, nine \& ten. ⋮ Almost all graphs are rigid-revisited ⋮ 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 ⋮ On an asymptotic evaluation of the cycle index of the symmetric group ⋮ Minimal algebras of infinite representation type with preprojective component ⋮ Matchings in pentagonal chains ⋮ On labeled vertex-transitive digraphs with a prime number of vertices ⋮ Points by degree and orbit size in chemical trees. II ⋮ Symbolic calculation of the trace of the power of a tridiagonal matrix ⋮ The chromatic polynomial of an unlabeled graph ⋮ Isomorphic factorizations VIII: Bisectable trees ⋮ On the succinct representation of graphs ⋮ An invariant theory approach to graph enumeration ⋮ Counting labelled chordal graphs ⋮ 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 ⋮ Per-spectral and adjacency spectral characterizations of a complete graph removing six edges ⋮ Metric transforms of finite spaces and connected graphs
This page was built for publication: