Critical properties of graphs of bounded clique-width
From MaRDI portal
Recommendations
Cited in
(14)- Clique-width of countable graphs: A compactness property.
- The computational complexity of dominating set problems for instances with bounded minors of constraint matrices
- Critical properties and complexity measures of read-once Boolean functions
- The computational complexity of three graph problems for instances with bounded minors of constraint matrices
- On the existence of critical clique-Helly graphs
- Clique-width of countable graphs: a compactness property
- Clique width of partner limited graphs
- A boundary property for upper domination
- From Tree-Width to Clique-Width: Excluding a Unit Interval Graph
- The behavior of clique-width under graph operations and graph transformations
- Graph problems and monotone classes
- Upper domination: towards a dichotomy through boundary properties
- Graph classes with and without powers of bounded clique-width
- Recent developments on graphs of bounded clique-width
This page was built for publication: Critical properties of graphs of bounded clique-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1947013)