The following pages link to Between treewidth and clique-width (Q300479):
Displaying 7 items.
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- Computing the chromatic number using graph decompositions via matrix rank (Q2330132) (← links)
- Characterizing graphs of maximum matching width at most 2 (Q2413972) (← links)
- On Structural Parameterizations of Graph Motif and Chromatic Number (Q2971640) (← links)
- (Q5002765) (← links)
- Computing the Chromatic Number Using Graph Decompositions via Matrix Rank (Q5009610) (← links)
- Finer Tight Bounds for Coloring on Clique-Width (Q5130905) (← links)