scientific article; zbMATH DE number 3910422

MaRDI QIDQ3688415zbMATH OpenFDO

Authors Edward A. Bender, L. Bruce Richmond, Nicholas Wormald

Publication date 1985

zbMATH Keywords

asymptotic numberchordal graphconnectivitylargest cliquerandom graphsplit graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• A Separator Theorem for Chordal Graphs
• Clique Partitions of Chordal Graphs
• The size of chordal, interval and threshold subgraphs
• scientific article; zbMATH DE number 4073034
• Connectivity threshold for random chordal graphs

Cited in

(37)

• Counting labelled chordal graphs
• Connectivity threshold for random chordal graphs
• The first order convergence law fails for random perfect graphs
• A complete characterization of bidegreed split graphs with four distinct signless Laplacian eigenvalues
• Fixed cardinality stable sets
• Split graphs: combinatorial species and asymptotics
• Enumeration of chordal planar graphs and maps
• On split graphs with four distinct eigenvalues
• On the kernelization of split graph problems
• On the arrangement of cliques in chordal graphs with respect to the cuts
• A Separator Theorem for Chordal Graphs
• scientific article; zbMATH DE number 4055650 (Why is no real title available?)
• Graphs and degree sequences. I
• Clique Partitions of Chordal Graphs
• Computing and Combinatorics
• Strict chordal and strict split digraphs
• On finding separators in temporal split and permutation graphs
• Decomposing split graphs into locally irregular graphs
• On finding separators in temporal split and permutation graphs
• The overfull conjecture on split-comparability and split-interval graphs
• Broadcasting in split graphs
• Complete characterization of the bidegreed split graphs with three or four distinct \(A_{\alpha}\)-eigenvalues
• Further split graphs known to be class 1 and a characterization of subgraph-overfull split graphs
• Finding biclique partitions of co-chordal graphs
• The regularity of almost all edge ideals
• On split graphs with three or four distinct (normalized) Laplacian eigenvalues
• On a wider class of prior distributions for graphical models
• On the Colin de Verdière number of graphs
• The structure of almost all graphs in a hereditary property
• Chordal graphs with bounded tree-width
• Chordal graphs with bounded tree-width (extended abstract)
• Enumeration of interval graphs and d-representable complexes
• Sampling unlabeled chordal graphs in expected polynomial time
• Cayley trees and increasing 1, 2-trees: let's twist!
• Succinct data structures for chordal graph with bounded leafage or vertex leafage
• Graph limits and hereditary properties
• Critical exponents of graphs

This page was built for publication:

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