Distance-hereditary graphs

1986/10/01 by Hans‐Jürgen Bandelt, Hans-Jürgen Bandelt, Henry Martyn Mulder · 3 citations
Computer Science · Engineering · Mathematics · #1-planar graph #Advanced Graph Theory Research #Chordal graph #Combinatorics #Discrete mathematics #Graph #Graph Labeling and Dimension Problems #Indifference graph #Line graph #Mathematics #Multipartite #Pathwidth #Physics #graph theory and CDMA systems

paper · doi:10.1016/0095-8956(86)90043-2

crossref issued 1986/10/01 · crossref published 1986/10/01 · crossref published-print 1986/10/01 · openalex publication_date 1986/10/01 · crossref created 2005/02/09 · crossref deposited 2019/01/29 · openalex created_date 2025/10/10 · crossref indexed 2026/07/15 · openalex updated_date 2026/07/23

Citations

• Complement reducible graphs
• On a class of posets and the corresponding comparability graphs
• A Characterization of Certain Ptolemaic Graphs

Cited by

• Computing treewidth and minimum fill-in: All you need are the minimal separators
• Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs
• Perfect graph [wikipedia]