Pages that link to "Item:Q2161252"
From MaRDI portal
The following pages link to Vertex partitioning problems on graphs with bounded tree width (Q2161252):
Displaying 10 items.
- MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481) (← links)
- Block-cutvertex trees and block-cutvertex partitions (Q1849911) (← links)
- Tree partitioning via vertex deletion (Q2816023) (← links)
- A Rooted-Forest Partition with Uniform Vertex Demand (Q3404442) (← links)
- (Q3611470) (← links)
- (Q4996553) (← links)
- (Q5414632) (← links)
- Finding matching cuts in \(H\)-free graphs (Q6046951) (← links)
- Minimization and parameterized variants of vertex partition problems on graphs (Q6087212) (← links)
- Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius (Q6614030) (← links)