scientific article; zbMATH DE number 3419161

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

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, Cyclic homology and the determinant of the Cartan matrix, Counting two-dimensional posets, 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, Central and local limit theorems for the coefficients of polynomials associated with the Laguerre ones, 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, Enumeration of unlabelled bicolored graphs by degree parities, Graph-theoretic interpretation of the generalized row sum method, Random enriched trees with applications to random graphs, 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, Enumerating graphs via even/odd dichotomy, Polynomial invariants for trees. A statistical mechanics approach, Enumeration of unlabelled graphs with specified degree parities, Enumerating transformation semigroups, 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, A novel approach to perturbative calculations for a large class of interacting boson theories, Enumeration of labelled chain graphs and labelled essential directed acyclic graphs., The asymptotic number of claw-free cubic graphs., Efficient counting of degree sequences, Height counting of unlabeled interval and $N$-free posets., Generalizations of theorems of Wilson, Fermat and Euler, Une théorie combinatoire des séries formelles, The number of trees half of whose vertices are leaves and asymptotic enumeration of plane real algebraic curves., 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, Algebraic connectivity may explain the evolution of gene regulatory networks, On the number of spanning trees in alternating polycyclic chains, 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, Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width, On oriented 2-factorable graphs, 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, Partitions and permutations, Développements recents de la théorie des graphes, Arithmetical properties of finite graphs and polynomials, Efficient enumeration of sensed planar maps, Connectability and structural controllability of composite systems, Periodic solutions for completely resonant nonlinear wave equations with Dirichlet boundary conditions, 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, Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs, Sulla cardinabilita delle classi di 6-5-grafi, On-line computation of convolutions, 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, Counting Witt rings, Upper bounds on the size of obstructions and intertwines, On an asymptotic method in enumeration, Labelled and unlabelled enumeration of $k$-gonal 2-trees, Enumeration of cubic graphs by inclusion-exclusion, Counting bridgeless graphs, Hereditarily finite sets and identity trees, On monotone functions of tree structures, 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, Group theory method for enumeration of outerplanar graphs, On the number of phenotype structures in genetic systems, Analytic combinatorics of non-crossing configurations, Enumerative aspects of certain subclasses of perfect graphs, Computers and discovery in algebraic graph theory, Quantifying fault recovery in multiprocessor systems, Primitivity of permutation groups, coherent algebras and matrices, On a reconstruction problem of Harary and Manvel, Priors on network structures. Biasing the search for Bayesian networks, Patchworks and metablocks enumeration, Permutations with $p^ l$th roots, On the Tutte and Matching Polynomials for Complete Graphs, Vector Spaces of Permutomers and Symmetry Itemized Isomers Numbers for Substituted C2v-Based Compounds. I, Enumeration of graphs with given weighted number of connected components, All Circuits Enumeration in Macro-Econometric Models, Unnamed Item, On the number of labeled outerplanar $k$-cyclic bridgeless graphs, On anti-stochastic properties of unlabeled graphs, On the probability that a random subtree is spanning, Counting maximal independent sets in some $n$-gonal cacti, Unnamed Item, Construction of the developing connecting tree, Exact enumeration of satisfiable 2-SAT formulae, Graphs and algebras of symmetric functions, Unnamed Item, Central Limit Theorems for Additive Tree Parameters with Small Toll Functions, Unnamed Item, Enumeration of labeled outerplanar bicyclic and tricyclic graphs, Digraphs with at most one trivial critical ideal, Enumerating Cayley (di-)graphs on dihedral groups, Enumeration of bipartite self-complementary graphs, AN ALTERNATIVE WAY OF DEFINING FINITE GRAPHS, Fifty years of the spectrum problem: survey and new results, Counting equivalence classes of vertex pairs modulo the dihedral action on the associahedron, 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, Unnamed Item, Almost every graph has a fixed edge, Analytic analysis of algorithms, Random 2-XORSAT at the Satisfiability Threshold, Subcritical Graph Classes Containing All Planar Graphs, Counting graded lattices of rank 3 that have few coatoms, Expected Maximum Block Size in Critical Random Graphs, The Second Riddell Relation and Its Consequences, Graph limits of random unlabelled k-trees, Graph limits of random graphs from a subset of connected k‐trees, Unnamed Item, On superconformal characters and partition functions in three dimensions, The Monoids of Order Eight and Nine, A Class of Matrices Connected with Volterra Prey-Predator Equations, Unnamed Item, Enumeration of labeled block-cactus graphs, A theory of even functionals and their algorithmic applications, Complementary eigenvalues of graphs, Points and lines configurations for perpendicular bisectors of convex cyclic polygons, Unnamed Item, Graphs, partitions and Fibonacci numbers, Signatures of extremal 2-unifrom hypergraphs, Packing and Covering Constants for Certain Families of Trees. II, Self-converse mixed graphs are extremely rare, Unnamed Item, 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, Tree-Like Structure Graphs with Full Diversity of Balls, Enumeration of labeled connected graphs with given order and size, Enumeration of Hamiltonian Cycles and Paths in a Graph, Generating effective symmetry-breaking predicates for search problems, Salient feature and reliable classifier selection for facial expression classification, Response solutions for strongly dissipative quasi-periodically forced systems with arbitrary nonlinearities and frequencies, Unnamed Item, Unnamed Item, Measuring similarity between connected graphs: the role of induced subgraphs and complementarity eigenvalues, Enumeration of labeled geodetic graphs with small cyclomatic number, 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, Maximum number of subtrees in cacti and block graphs, Localization in quiver moduli spaces, Counting graphs with different numbers of spanning trees through the counting of prime partitions, Enumeration of (uni- or bicolored) plane trees according to their degree distribution, Scaling limits of random Pólya trees, Edge-colouring graphs with bounded local degree sums, Computational multinomial combinatorics for colorings of 5D-hypercubes for all irreducible representations and applications, Repetition of spectral radiuses among connected induced subgraphs, False information from near and far, Limits of random tree-like discrete structures, A Uniform Approach Towards Succinct Representation of Trees, Counting extensional acyclic digraphs, Characterizations of graphs having orientations satisfying local degree restrictions, Spin chains with dynamical lattice supersymmetry, On chromatic Zagreb indices of certain graphs, Local convergence of random planar graphs, Counting Interval Graphs, A uniform paradigm to succinctly encode various families of trees, On a conjecture of the Randić index and the minimum degree of graphs, Enumeration of unlabeled uniform hypergraphs, Counting unlabeled $k$-trees, An exponential formula for polynomial vector fields. II: Lie series, exponential substitution, and rooted trees, From Schur Rings to Constructive and Analytical Enumeration of Circulant Graphs with Prime-Cubed Number of Vertices, Enumeration and 3D representation of the stereo-isomers of alkane molecules, On cardinality of complementarity spectra of connected graphs, Unnamed Item, Enumerating tree-like polyphenyl isomers, An analysis of neighborhood functions on generic solution spaces, Counting labeled general cubic graphs, Enumerating alternating matrix spaces over finite fields with explicit coordinates, Enumeration and generation with a string automata representation, Counting finite models, A motif building process for simulating random networks, Brown's theorem and its application for enumeration of dissections and planar trees, A note on labeled symmetric graphs, Generalization of the Harary-Palmer power group theorem to all irreducible representations of object and color groups -- color combinatorial group theory., Permanental sums of graphs of extreme sizes, Hypergraphs, characteristic polynomials and permutation characters, Succinct representation of general unlabeled graphs, An Application of Polya's Enumeration Theorem to Partitions of Subsets of Positive Integers, Constructions of maximum few-distance sets in Euclidean spaces, Asymptotic enumeration of Cayley digraphs, On the size of two families of unlabeled bipartite graphs, The Number of Labeled Connected Graphs Modulo Prime Powers, Counting labeled claw-free cubic graphs by connectivity, Asymptotic enumeration and limit laws of planar graphs, Computational combinatorics of hyperplane colorings of 6D-hypercube for all irreducible representations and applications, Enumeration of relativistic states for superheavy and transactinide dimers in the periodic table, Who learns better Bayesian network structures: accuracy and speed of structure learning algorithms, Learning Bayesian networks from incomplete data with the node-average likelihood, One-sided variations on interval trees, Enumerating Types of Boolean Functions, Isomorphism and Symmetries in Random Phylogenetic Trees, Representation of fragmentary structures by oriented graphs, Two critical periods in the evolution of random planar graphs, Variable selection in compositional data analysis using pairwise logratios, The number of caterpillars, On the number of $n$-plexes, A Random Graph With a Subcritical Number of Edges, Forcing bonds of a benzenoid system, Enumeration of solid 2-trees according to edge number and edge degree distribution, Multinomial permutations on a circle, Learning Bayesian networks from big data with greedy search: computational complexity and efficient implementation, Random cubic planar graphs, Acyclic Digraphs, Tensors and Graphs, Principles of cost minimisation in wireless networks, The maximal length of 2-path in random critical graphs, Some useful preservation theorems, Efficient dominating sets in labeled rooted oriented trees, Counting the number of Feynman graphs in QCD, Global asymptotic stability for a class of many-variable volterra prey-predator systems, Tomography on Finite Graphs, Almost all graphs are rigid - Revisited, Classification of infinitesimal homeostasis in four-node input-output networks, Combinatorial approach to group hierarchy for stereoskeletons of ligancy 4, On the Order of Random Channel Networks