The tree- and clique-width of bipartite graphs in special classes
From MaRDI portal
(Redirected from Publication:5487903)
Recommendations
Cited in
(28)- Chordal bipartite graphs of bounded tree- and clique-width
- Treewidth versus clique number in graph classes with a forbidden structure
- Tree-width dichotomy
- The (theta, wheel)-free graphs. III: Cliques, stable sets and coloring
- Between clique-width and linear clique-width of bipartite graphs
- On the complexity of the identifiable subgraph problem
- Volume computation for sparse Boolean quadric relaxations
- Colouring square-free graphs without long induced paths
- On efficient domination for some classes of H-free bipartite graphs
- Bounding clique-width via perfect graphs
- scientific article; zbMATH DE number 1696534 (Why is no real title available?)
- Bounding clique-width via perfect graphs
- Clique-width of graph classes defined by two forbidden induced subgraphs
- Tree-Width and Optimization in Bounded Degree Graphs
- THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
- Bipartite graphs of large clique-width
- Dominating induced matchings
- A new graph construction of unbounded clique-width
- scientific article; zbMATH DE number 7204407 (Why is no real title available?)
- Clique-width for graph classes closed under complementation
- On the Treewidth and Pathwidth of Biconvex Bipartite Graphs
- Bounding the clique-width of \(H\)-free split graphs
- Clique‐width: Harnessing the power of atoms
- Graph problems and monotone classes
- MSOL partitioning problems on graphs of bounded treewidth and clique-width
- Graph classes with and without powers of bounded clique-width
- Classifying the clique-width of \(H\)-free bipartite graphs
- Recent developments on graphs of bounded clique-width
This page was built for publication: The tree- and clique-width of bipartite graphs in special classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5487903)
