Chordal graphs with bounded tree-width
From MaRDI portal
Publication:6499440
DOI10.1016/J.AAM.2024.102700MaRDI QIDQ6499440
Marc Noy, Michael Drmota, Clément Requilé, Jordi Castellví
Publication date: 8 May 2024
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Asymptotic enumeration (05A16) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Scaling limits of random graphs from subcritical classes
- The continuum random tree. I
- On rigid circuit graphs
- Holomorphic functions of several variables. An introduction to the fundamental theory. With the assist. of Gottfried Barthel transl. by Michael Bridgland
- Small graph classes and bounded expansion
- A complete grammar for decomposing a family of graphs into 3-connected components
- Counting labelled chordal graphs
- Algorithmic graph theory and perfect graphs
- Enumeration of chordal planar graphs and maps
- Enumeration and limit laws for series-parallel graphs
- Proper minor-closed families are small
- Asymptotic Study of Subcritical Graph Classes
- Random Trees
- Parameterized Algorithms
- The number of labeled k-dimensional trees
- The number of labeled k-trees
- On the number of labeled graphs of bounded treewidth
This page was built for publication: Chordal graphs with bounded tree-width
