The following pages link to (Q4448752):
Displaying 18 items.
- On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract) (Q3503637) (← links)
- Computing Graph Polynomials on Graphs of Bounded Clique-Width (Q3522957) (← links)
- Clique-Width is NP-Complete (Q3563951) (← links)
- (Q4608071) (← links)
- (Q4625695) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- Tree Pivot-Minors and Linear Rank-Width (Q5020842) (← links)
- (Q5111290) (← links)
- Clique-Width for Graph Classes Closed under Complementation (Q5112821) (← links)
- Covering a Graph with Clubs (Q5377354) (← links)
- Canonisation and Definability for Graphs of Bounded Rank Width (Q5875948) (← links)
- An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width (Q5918121) (← links)
- Clique-width and well-quasi-ordering of triangle-free graph classes (Q5918202) (← links)
- Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
- Stability, vertex stability, and unfrozenness for special graph classes (Q6151148) (← links)
- Succinct data structures for bounded clique-width graphs (Q6497944) (← links)
- \(b\)-coloring parameterized by clique-width (Q6614620) (← links)