Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs

2011/07/26 by Emeric Gioan, Christophe Paul · 2 citations
Computer Science · Mathematics · #1-planar graph #Advanced Graph Theory Research #Bijection #Block graph #Chordal graph #Cograph #Combinatorics #Discrete mathematics #Graph #Graph Labeling and Dimension Problems #Graph theory and applications #Indifference graph #Intersection graph #Line graph #Mathematics #Modular decomposition #Pathwidth #Split graph

paper · doi:10.1016/j.dam.2011.05.007

openalex publication_date 2011/07/26 · crossref created 2011/07/26 · crossref issued 2012/04/01 · crossref published 2012/04/01 · crossref published-print 2012/04/01 · crossref deposited 2018/12/01 · openalex created_date 2025/10/10 · crossref indexed 2026/07/15 · openalex updated_date 2026/07/22

Citations

• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Graph classes between parity and distance-hereditary graphs
• Distance-hereditary graphs

Cited by

• The Path-Extremal Conjecture for Zero Forcing: Distance-Hereditary Graphs and a Split-Decomposition Reduction
• Cograph [wikipedia]