The NLC-width and clique-width for powers of graphs of bounded tree-width

2008/09/25 by Frank Gurski, Egon Wanke · 12 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Bounded function #Chordal graph #Clique #Combinatorics #Discrete mathematics #Graph #Graph theory and applications #Interconnection Networks and Systems #Line graph #Mathematical analysis #Mathematics #Pathwidth #Tree (set theory) #Treewidth

paper · doi:10.1016/j.dam.2008.08.031

published in Discrete Applied Mathematics 157(4), 583-595 (Elsevier BV)

openalex publication_date 2008/09/25 · crossref created 2008/09/25 · crossref issued 2009/02/01 · crossref published 2009/02/01 · crossref published-print 2009/02/01 · crossref deposited 2018/12/25 · crossref indexed 2025/10/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/03/10

Citations

• Coloring Powers of Graphs of Bounded Clique-Width
• Ptolemaic Graphs and Interval Graphs Are Leaf Powers
• Upper bounds to the clique width of graphs
• Graph minors. I. Excluding a forest
• k-NLC graphs and polynomial algorithms
• Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width

Cited by

• Clique-width [wikipedia]