Chordal graphs with bounded tree-width

DOI10.1016/J.AAM.2024.102700MaRDI QIDQ6499440zbMATH OpenFDO

Authors Jordi Castellví, Michael Drmota, Marc Noy, Clément Requilé

Publication date 8 May 2024

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AAM.2024.102700

zbMATH Keywords

cliquesconnectivitygenerating functionslabelled chordal graphs

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16) Trees (05C05) Enumeration in graph theory (05C30) Connectivity (05C40) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Enumeration of chordal planar graphs and maps
• Counting labelled chordal graphs

Cites work

• A complete grammar for decomposing a family of graphs into 3-connected components
• Algorithmic graph theory and perfect graphs
• Analytic combinatorics
• Asymptotic study of subcritical graph classes
• Counting labelled chordal graphs
• Enumeration and limit laws for series-parallel graphs
• Enumeration of chordal planar graphs and maps
• Holomorphic functions of several variables. An introduction to the fundamental theory. With the assist. of Gottfried Barthel transl. by Michael Bridgland
• scientific article; zbMATH DE number 3910422 (Why is no real title available?)
• On rigid circuit graphs
• Parameterized algorithms
• Proper minor-closed families are small
• Random Trees
• Scaling limits of random graphs from subcritical classes
• Small graph classes and bounded expansion
• The continuum random tree. I
• The number of labeled k-dimensional trees
• The number of labeled k-trees

This page was built for publication: Chordal graphs with bounded tree-width

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499440)