Connectivity threshold for random chordal graphs

DOI10.1007/BF01788142zbMath0763.05061OpenAlexW2058048823MaRDI QIDQ1175564

Edward R. Scheinerman, Fred R. McMorris

Publication date: 25 June 1992

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

Full work available at URL: https://doi.org/10.1007/bf01788142

zbMATH Keywords

connectivitythresholdErdős-Rényi modelrandom chordal graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Connectivity (05C40)

Related Items (11)

Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2 ⋮ What Is between Chordal and Weakly Chordal Graphs? ⋮ Tree representations of graphs ⋮ Intersection graphs of orthodox paths in trees ⋮ Constant threshold intersection graphs of orthodox paths in trees ⋮ The intersection graph of random sets ⋮ Constant tolerance intersection graphs of subtrees of a tree ⋮ Equivalences and the complete hierarchy of intersection graphs of paths in a tree ⋮ Recognizing vertex intersection graphs of paths on bounded degree trees ⋮ Intersection models of weakly chordal graphs ⋮ Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid

Cites Work

• An evolution of interval graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Representations of chordal graphs as subtrees of a tree
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Connectivity threshold for random chordal graphs