The tree- and clique-width of bipartite graphs in special classes
From MaRDI portal
Publication:5487903
zbMATH Open1102.68098MaRDI QIDQ5487903FDOQ5487903
Authors: Dieter Rautenbach, Vadim Lozin 
Publication date: 13 September 2006
Recommendations
Cited In (25)
- Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs
- Bipartite graphs of large clique-width
- On efficient domination for some classes of \(H\)-free bipartite graphs
- On the Treewidth and Pathwidth of Biconvex Bipartite Graphs
- Clique-Width for Graph Classes Closed under Complementation
- Title not available (Why is that?)
- On the complexity of the identifiable subgraph problem
- Recent developments on graphs of bounded clique-width
- Volume computation for sparse Boolean quadric relaxations
- Bounding the clique-width of \(H\)-free split graphs
- Bounding clique-width via perfect graphs
- Colouring square-free graphs without long induced paths
- MSOL partitioning problems on graphs of bounded treewidth and clique-width
- Clique‐width: Harnessing the power of atoms
- Graph classes with and without powers of bounded clique-width
- Classifying the clique-width of \(H\)-free bipartite graphs
- Chordal bipartite graphs of bounded tree- and clique-width
- The (theta, wheel)-free graphs. III: Cliques, stable sets and coloring
- THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
- Dominating induced matchings
- Treewidth versus clique number in graph classes with a forbidden structure
- Bounding Clique-Width via Perfect Graphs
- Tree-Width and Optimization in Bounded Degree Graphs
- Title not available (Why is that?)
- A new graph construction of unbounded 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)
