• Corpus ID: 453914

Enumeration of unlabeled graph classes

@inproceedings{Shi2016EnumerationOU,
  title={Enumeration of unlabeled graph classes},
  author={Jessica Shi and J{\'e}r{\'e}mie O. Lumbroso},
  year={2016}
}
In this paper, we study the enumeration of certain classes of graphs that can be fully characterized by tree decompositions; these classes are particularly significant due to the algorithmic improvements derived from tree decompositions on classically NP-complete problems on these classes [12, 7, 17, 35]. Previously, Chauve et al. [6] and Iriza [26] constructed grammars from the split decomposition trees of distance hereditary graphs and 3-leaf power graphs. We extend upon these results to… 

References

SHOWING 1-10 OF 58 REFERENCES
Graph Classes Between Parity and Distance-hereditary Graphs
Split decomposition and graph-labelled trees: characterizations and fully-dynamic algorithms for totally decomposable graphs
On the Extension of Bipartite to Parity Graphs
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.
The enumeration of bipartite graphs
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.
A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs
TLDR
A near-optimal fully dynamic algorithm for the problem of recognizing and representing dynamically changing proper interval graphs that operates in time O(log n) per edge insertion or deletion is given.
The Number of Trees
The mathematical theory of trees was first discussed by Cayley in 1857 (1). He was successful in finding recursion formulas for counting the number of trees or rooted trees having a finite number of
Decomposition of Directed Graphs
A composition for directed graphs which generalizes the substitution (or X-join) composition of graphs and digraphs, as well as the graph version of set-family composition, is described. It is proved
...
...