The following pages link to Forbidden subgraph decomposition (Q1598796):
Displaying 5 items.
- On the complexity of some edge-partition problems for graphs (Q1923590) (← links)
- The complexity of the matching-cut problem for planar graphs and other graph classes (Q3652545) (← links)
- Matching cut in graphs with large minimum degree (Q5925521) (← links)
- Domination graphs: Examples and counterexamples (Q5936465) (← links)
- \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs (Q6188517) (← links)