The following pages link to (Q5487903):
Displaying 22 items.
- A new graph construction of unbounded clique-width (Q509276) (← links)
- MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481) (← links)
- Graph classes with and without powers of bounded clique-width (Q896650) (← links)
- Classifying the clique-width of \(H\)-free bipartite graphs (Q906431) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- Treewidth versus clique number in graph classes with a forbidden structure (Q2110610) (← links)
- The (theta, wheel)-free graphs. III: Cliques, stable sets and coloring (Q2173433) (← links)
- On the complexity of the identifiable subgraph problem (Q2255039) (← links)
- Volume computation for sparse Boolean quadric relaxations (Q2297660) (← links)
- Colouring square-free graphs without long induced paths (Q2323345) (← links)
- On efficient domination for some classes of \(H\)-free bipartite graphs (Q2334041) (← links)
- Bounding clique-width via perfect graphs (Q2424685) (← links)
- Bounding Clique-Width via Perfect Graphs (Q2799217) (← links)
- Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs (Q2947018) (← links)
- Tree-Width and Optimization in Bounded Degree Graphs (Q3508553) (← links)
- THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES (Q3526986) (← links)
- Dominating Induced Matchings (Q3655141) (← links)
- (Q5111290) (← links)
- Clique-Width for Graph Classes Closed under Complementation (Q5112821) (← links)
- On the Treewidth and Pathwidth of Biconvex Bipartite Graphs (Q5425437) (← links)
- Bounding the clique-width of \(H\)-free split graphs (Q5965534) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
