Enumeration of \(P_4\)-free chordal graphs

DOI10.1007/s00373-002-0513-9zbMath1032.05067OpenAlexW2015945630MaRDI QIDQ1423492

Nicholas C. Wormald, Robert Castelo

Publication date: 4 March 2004

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-002-0513-9

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30)

Related Items (5)

A characterization of moral transitive acyclic directed graph Markov models as labeled trees. ⋮ Comments on: Sequences of regressions and their independences ⋮ Three Schur functors related to pre-Lie algebras ⋮ Enumerations, forbidden subgraph characterizations, and the split-decomposition ⋮ Chordal 2‐Connected Graphs and Spanning Trees

This page was built for publication: Enumeration of \(P_4\)-free chordal graphs