A local characterization of bounded clique-width for line graphs
From MaRDI portal
Publication:868337
DOI10.1016/J.DISC.2006.07.004zbMATH Open1114.05088OpenAlexW2006089834MaRDI QIDQ868337FDOQ868337
Authors: 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
Recommendations
Cites Work
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- Graph minors. II. Algorithmic aspects of tree-width
- Graph minors. I. Excluding a forest
- Monadic second-order evaluations on tree-decomposable graphs
- \(k\)-NLC graphs and polynomial algorithms
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
- On the relationship between NLC-width and linear NLC-width
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph-Theoretic Concepts in Computer Science
- Fundamentals of Computation Theory
Cited In (5)
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
- Line graphs of bounded clique-width
- A Local Strengthening of Reed's $\omega$, $\Delta$, $\chi$ Conjecture for Quasi-line Graphs
- A Complete Characterisation of the Linear Clique-Width of Path Powers
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: A local characterization of bounded clique-width for line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868337)
