Splitting a graph into disjoint induced paths or cycles

2003/02/04 by Hoàng-Oanh Le, Van Bang Lê, Van Bang Le +1 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Block graph #Chordal graph #Cograph #Combinatorics #Computational Geometry and Mesh Generation #Data Visualization and Analytics #Discrete mathematics #Graph #Line graph #Mathematics #Partial k-tree #Pathwidth #Split graph #Treewidth

paper · pdf · doi:10.1016/s0166-218x(02)00425-0

openalex publication_date 2003/02/04 · crossref created 2003/02/04 · crossref issued 2003/09/01 · crossref published 2003/09/01 · crossref published-print 2003/09/01 · crossref deposited 2019/03/30 · openalex created_date 2025/10/10 · crossref indexed 2026/06/15 · openalex updated_date 2026/08/02

Citations

• The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• Complexity of Finding Embeddings in a k -Tree

Cited by

• Induced path [wikipedia]