A local characterization of bounded clique-width for line graphs

DOI10.1016/j.disc.2006.07.004zbMath1114.05088OpenAlexW2006089834MaRDI QIDQ868337

Frank Gurski, Egon Wanke

Publication date: 2 March 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.07.004

zbMATH Keywords

NLC-widthco-gem-free line graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Cites Work

• Unnamed Item
• Unnamed Item
• Monadic second-order evaluations on tree-decomposable graphs
• Graph minors. I. Excluding a forest
• \(k\)-NLC graphs and polynomial algorithms
• Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
• Linear time solvable optimization problems on graphs of bounded clique-width
• Upper bounds to the clique width of graphs
• On the relationship between NLC-width and linear NLC-width
• Graph minors. II. Algorithmic aspects of tree-width
• Fundamentals of Computation Theory
• GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: A local characterization of bounded clique-width for line graphs