On the clique cover width problem
From MaRDI portal
Recommendations
Cited in
(9)- On the triangle clique cover and \(K_t\) clique cover problems
- Bounds for the clique cover width of factors of the apex graph of the planar grid
- Unit incomparability dimension and clique cover width in graphs
- On the largest reduced neighborhood clique cover number of a graph
- A note on the clustered set covering problem
- Clique cover width and clique sum
- Data reduction and exact algorithms for clique cover
- Clique-width of point configurations
- Bandwidth of graphs resulting from the edge clique covering problem
This page was built for publication: On the clique cover width problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3015662)
