Characterizations of strongly chordal graphs

1983/01/01 by Martin Farber · 271 citations
Computer Science · Mathematics · #1-planar graph #Advanced Graph Theory Research #Characterization (materials science) #Chordal graph #Combinatorics #Discrete mathematics #Graph #Graph Labeling and Dimension Problems #Graph theory and applications #Indifference graph #Interval graph #Line graph #Mathematics #Maximal independent set #Pathwidth #Time complexity

paper · pdf · doi:10.1016/0012-365x(83)90154-1

published in Discrete Mathematics 43(2-3), 173-189 (Elsevier BV)

crossref issued 1983/01/01 · crossref published 1983/01/01 · crossref published-print 1983/01/01 · openalex publication_date 1983/01/01 · crossref created 2002/09/17 · crossref deposited 2019/04/09 · openalex created_date 2025/10/10 · crossref indexed 2026/07/31 · openalex updated_date 2026/08/02

Citations

• The intersection graphs of subtrees in trees are exactly the chordal graphs
• On rigid circuit graphs
• Algorithmic Graph Theory and Perfect Graphs

Cited by

• Doubly Lexical Orderings of Matrices
• Doubly lexical ordering of dense 0–1 matrices
• Structure and linear time recognition of 3-leaf powers
• Rooted directed path graphs are leaf powers
• A characterization of strongly chordal graphs
• A new characterization of strongly chordal graphs
• Maxclique and unit disk characterizations of strongly chordal graphs
• Strongly chordal graph [wikipedia]