A local characterization of bounded clique-width for line graphs
From MaRDI portal
Publication:868337
DOI10.1016/j.disc.2006.07.004zbMath1114.05088MaRDI QIDQ868337
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
05C75: Structural characterization of families of graphs
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