An Exact Enumeration of Distance-Hereditary Graphs

@article{Chauve2017AnEE,
  title={An Exact Enumeration of Distance-Hereditary Graphs},
  author={C{\'e}dric Chauve and {\'E}ric Fusy and J{\'e}r{\'e}mie O. Lumbroso},
  journal={ArXiv},
  year={2017},
  volume={abs/1608.01464}
}
Distance-hereditary graphs form an important class of graphs, from the theoretical point of view, due to the fact that they are the totally decomposable graphs for the split-decomposition. The previous best enumerative result for these graphs is from Nakano et al. (J. Comp. Sci. Tech., 2007), who have proven that the number of distance-hereditary graphs on $n$ vertices is bounded by ${2^{\lceil 3.59n\rceil}}$. In this paper, using classical tools of enumerative combinatorics, we improve on… 

Figures from this paper

Split-Decomposition Trees with Prime Nodes: Enumeration and Random Generation of Cactus Graphs

TLDR
A characterization for the split-decomposition trees of cactus graphs is derived, a general template of symbolic grammars are produced, and random generation is implemented for these graphs, building on work by Iriza (2015).

Enumerations, Forbidden Subgraph Characterizations, and the Split-Decomposition

TLDR
A methodology by which a split-decomposition tree is constrain to avoid certain patterns, thereby avoiding the corresponding induced subgraphs in the original graph is shown.

Grammars and clique-width bounds from split decompositions

  • B. Courcelle
  • Computer Science, Mathematics
    Discret. Appl. Math.
  • 2020

Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs

TLDR
This work designs succinct encodings of series-parallel, block-cactus and 3-leaf power graphs while supporting the basic navigational queries such as degree, adjacency and neighborhood optimally in the RAM model with logarithmic word size to provide succinct data structures with optimal query support for the first time in the literature.

Scaling limit of graph classes through split decomposition

A BSTRACT . We prove that Aldous’ Brownian CRT is the scaling limit, with respect to the Gromov– Prokhorov topology, of uniform random graphs in each of the three following families of graphs:

References

SHOWING 1-10 OF 34 REFERENCES

Asymptotic Study of Subcritical Graph Classes

TLDR
A unified general method for the asymptotic study of graphs from the so-called subcritical graph classes, which include the classes of cacti graphs, outerplanar graphs, and series-parallel graphs, which works in both the labelled and unlabelled framework.

Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs

TLDR
Using classical cycle index enumeration with recent results from analytic combinatorics, several statistical properties of random unlabeled outerplanar graphs on n vertices are investigated, for instance concerning connectedness, the chromatic number, and the number of edges.

A Complete Grammar for Decomposing a Family of Graphs into 3-Connected Components

TLDR
This article translates Tutte's decomposition into a general grammar expressing any family of graphs in terms of the subfamily of graphs that are 3-connected, and recovers in a purely combinatorial way the analytic expression found by Gimenez and Noy for the series counting labelled planar graphs.

Enumerations, Forbidden Subgraph Characterizations, and the Split-Decomposition

TLDR
A methodology by which a split-decomposition tree is constrain to avoid certain patterns, thereby avoiding the corresponding induced subgraphs in the original graph is shown.

Tree-Representation of Set Families in Graph Decompositions and Efficient Algorithms

TLDR
In order to estimate the number of set families satisfying some closure axioms, new tools and techniques are developed to find tree-like representations for them and how the philosophy of decomposition can help to provide efficient solutions are shown.

Enumeration and Random Generation of Unlabeled Classes of Graphs: A Practical Study of Cycle Pointing and the Dissymmetry Theorem

TLDR
The power of the dissymmetry theorem is extended by showing that it in fact provides a Boltzmann sampler for the class in question, and an exposition of the cycle pointing technique is presented, with a focus on the enumeration and random generation of the underlying unpointed class.

A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs

TLDR
Based on the canonical tree representation, efficient algorithms for the distance-hereditary graphs are proposed, including linear time algorithms for graph recognition and graph isomorphism and an efficient enumeration algorithm.

Surveys in Combinatorics 2009: Counting planar graphs and related families of graphs

In this article we survey recent results on the asymptotic enumeration of planar graphs and, more generally, graphs embeddable in a fixed surface and graphs defined in terms of excluded minors. We

Practical and Efficient Split Decomposition via Graph-Labelled Trees

TLDR
This paper undertakes an investigation into the algorithmic properties of split decomposition in the context of graph-labelled trees (GLTs), a new combinatorial object designed to simplify its consideration.