Enumeration of non-separable graphs
From MaRDI portal
Publication:5620619
DOI10.1016/S0021-9800(70)80089-8zbMath0217.02501MaRDI QIDQ5620619
Publication date: 1970
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Related Items (26)
Counting unlabelled toroidal graphs with no \(K_{3,3}\)-subdivisions ⋮ Random enriched trees with applications to random graphs ⋮ Real functions as traces of infinite polynomials ⋮ Enumeration of unlabelled mating graphs ⋮ Jordan-like characterization of automorphism groups of planar graphs ⋮ Enumeration of point-determining graphs ⋮ Enumeration of bipartite graphs and bipartite blocks ⋮ The path-index of a graph ⋮ Limits of random tree-like discrete structures ⋮ 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 ⋮ Symmetries of unlabelled planar triangulations ⋮ A cycle index sum inversion theorem ⋮ Efficient counting of degree sequences ⋮ Computation of the expected number of leaves in a tree having a given automorphism, and related topics ⋮ Counting asymmetric enriched trees ⋮ On the symmetry and asymmetry of combinatorial structures ⋮ Enumeration of connected graphs with cut vertices ⋮ Efficient enumeration of sensed planar maps ⋮ Structure and enumeration of two-connected graphs with prescribed three-connected components ⋮ Enumeration under two representations of the wreath product ⋮ Counting bridgeless graphs ⋮ A survey of the asymptotic behaviour of maps ⋮ Counting labelled chordal graphs ⋮ The theory of compositionals
This page was built for publication: Enumeration of non-separable graphs
