New Graph Classes of Bounded Clique-Width

2004/07/14 by Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le +1 · 4 citations
Computer Science · Mathematics · #1-planar graph #Advanced Graph Theory Research #Bounded function #Chordal graph #Clique graph #Clique-sum #Clique-width #Combinatorics #Complexity and Algorithms in Graphs #Discrete mathematics #Graph #Graph power #Graph theory and applications #Line graph #Mathematics #Pathwidth #Treewidth #Vertex (graph theory) #Voltage graph

paper · doi:10.1007/s00224-004-1154-6

crossref issued 2004/07/14 · crossref published 2004/07/14 · crossref published-online 2004/07/14 · openalex publication_date 2004/07/14 · crossref created 2004/07/29 · crossref published-print 2005/09/01 · crossref deposited 2019/05/24 · crossref indexed 2025/10/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Citations

• Upper bounds to the clique width of graphs
• Handle-rewriting hypergraph grammars
• A Linear Recognition Algorithm for Cographs
• Complement reducible graphs
• Distance-hereditary graphs
• The Complexity of the Partial Order Dimension Problem
• Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width

Cited by

• Clique-Width for 4-Vertex Forbidden Subgraphs
• Polynomial-time recognition of clique-width ≤3 graphs
• Clique-Width is NP-Complete
• Clique-width [wikipedia]