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… Expand

References

SHOWING 1-10 OF 59 REFERENCES
Graph Classes Between Parity and Distance-hereditary Graphs
  • 22
  • Highly Influential
Split decomposition and graph-labelled trees: characterizations and fully-dynamic algorithms for totally decomposable graphs
  • 33
  • Highly Influential
  • PDF
On the Extension of Bipartite to Parity Graphs
  • 32
  • Highly Influential
  • PDF
Enumeration and Random Generation of Unlabeled Classes of Graphs: A Practical Study of Cycle Pointing and the Dissymmetry Theorem
  • 5
  • Highly Influential
  • PDF
The enumeration of bipartite graphs
  • P. Hanlon
  • Computer Science, Mathematics
  • Discret. Math.
  • 1979
  • 19
  • Highly Influential
A Complete Grammar for Decomposing a Family of Graphs into 3-Connected Components
  • 39
  • PDF
A fully dynamic algorithm for the recognition of P4-sparse graphs
  • 4
  • PDF
A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs
  • 15
  • Highly Influential
Modular decomposition and transitive orientation
  • 376
  • PDF
...
1
2
3
4
5
...