Enumerations, forbidden subgraph characterizations, and the split-decomposition
From MaRDI portal
Publication:668013
zbMath1409.05106arXiv1608.01465MaRDI QIDQ668013
Maryam Bahrani, Jérémie Lumbroso
Publication date: 5 March 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.01465
Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Asymptotic enumeration (05A16)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enumeration of bipartite graphs and bipartite blocks
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
- On graphs without a \(C_{4}\) or a diamond
- The enumeration of bipartite graphs
- A complete grammar for decomposing a family of graphs into 3-connected components
- Laminar structure of ptolemaic graphs with applications
- A calculus for the random generation of labelled combinatorial structures
- Enumeration of \(P_4\)-free chordal graphs
- The domatic number of block-cactus graphs
- Enumeration of \(m\)-ary cacti
- Forbidden subgraphs in connected graphs
- Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
- The number of trees
- Boltzmann Samplers, Pólya Theory, and Cycle Pointing
- Asymptotic Properties of Some Minor-Closed Classes of Graphs
- A Characterization of Block-Graphs
- A characterization of ptolemaic graphs
- Decomposition of Directed Graphs
- The on-line encyclopedia of integer sequences
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- Finding kth paths and p-centers by generating and searching good data structures
- Boltzmann Sampling of Unlabelled Structures
- An Exact Enumeration of Distance-Hereditary Graphs
- Split-Decomposition Trees with Prime Nodes: Enumeration and Random Generation of Cactus Graphs
- A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs
- A Characterization of Certain Ptolemaic Graphs
- On the Number of Husimi Trees
This page was built for publication: Enumerations, forbidden subgraph characterizations, and the split-decomposition
