Graphs of Linear Clique-Width at Most 3
From MaRDI portal
Publication:3502658
DOI10.1007/978-3-540-79228-4_29zbMath1139.05340OpenAlexW2173763064MaRDI QIDQ3502658
Daniel Meister, Charis Papadopoulos, Pinar Heggernes
Publication date: 27 May 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79228-4_29
Analysis of algorithms and problem complexity (68Q25) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs, On a disparity between relative cliquewidth and relative NLC-width
Cites Work
- Unnamed Item
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- Handle-rewriting hypergraph grammars
- Linear layouts measuring neighbourhoods in graphs
- On the relationship between NLC-width and linear NLC-width
- Clique-width minimization is NP-hard
- Domination on Cocomparability Graphs
- A Linear Recognition Algorithm for Cographs
- Graph Classes: A Survey