Counting labelled chordal graphs
From MaRDI portal
Publication:1062069
DOI10.1007/BF02582944zbMATH Open0572.05035MaRDI QIDQ1062069FDOQ1062069
Authors: Nicholas Wormald
Publication date: 1985
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Recommendations
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Connectivity (05C40)
Cites Work
Cited In (15)
- Chordal 2-connected graphs and spanning trees
- Enumeration of labelled essential graphs.
- Enumeration of \(P_4\)-free chordal graphs
- On listing, sampling, and counting the chordal graphs with edge constraints
- Title not available (Why is that?)
- Graphical posterior predictive classification: Bayesian model averaging with particle Gibbs
- Counting unlabelled chord diagrams of maximal genus
- Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
- MCMC model determination for discrete graphical models
- Enumeration of chordal planar graphs and maps
- Structural Markov graph laws for Bayesian model uncertainty
- Chordal graphs with bounded tree-width
- A characterization of moral transitive acyclic directed graph Markov models as labeled trees.
- Sequential sampling of junction trees for decomposable graphs
This page was built for publication: Counting labelled chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1062069)