Clique-width with an inactive label
From MaRDI portal
Recommendations
Cites work
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- Approximating clique-width and branch-width
- Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
- Claw-free graphs. III: Circular interval graphs
- Clique-width is NP-complete
- Complement reducible graphs
- Completely separable graphs
- Computing the clique-width of large path powers in linear time via a new characterisation of clique-width
- Distance-hereditary graphs
- Graphs of linear clique-width at most 3
- Handle-rewriting hypergraph grammars
- Linear clique-width for hereditary classes of cographs
- Linear layouts measuring neighbourhoods in graphs
- Linear rank-width and linear clique-width of trees
- Linear time solvable optimization problems on graphs of bounded clique-width
- Obstructions for linear rank-width at most 1
- On the clique-width of some perfect graph classes
- On the relationship between NLC-width and linear NLC-width
- Polynomial-time recognition of clique-width \(\leq 3\) graphs
- Rank-width and vertex-minors
- The relative clique-width of a graph
- Upper bounds to the clique width of graphs
Cited in
(3)
This page was built for publication: Clique-width with an inactive label
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q465271)