The following pages link to (Q4948751):
Displayed 4 items.
- Efficient algorithms for decomposing graphs under degree constraints (Q881575) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- Partitioning a graph into alliance free sets (Q1025928) (← links)
- Degree-constrained decompositions of graphs: Bounded treewidth and planarity (Q2369007) (← links)