Pages that link to "Item:Q5405029"
From MaRDI portal
The following pages link to A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width (Q5405029):
Displaying 9 items.
- On the expressive power of CNF formulas of bounded tree- and clique-width (Q617890) (← links)
- The NLC-width and clique-width for powers of graphs of bounded tree-width (Q1028448) (← links)
- Optimal centrality computations within bounded clique-width graphs (Q2093567) (← links)
- Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
- Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
- Deciding Clique-Width for Graphs of Bounded Tree-Width (Q4435348) (← links)
- (Q4638063) (← links)
- On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree (Q4652630) (← links)
- Graph classes and the switch Markov chain for matchings (Q5963358) (← links)
