The following pages link to (Q4948751):
Displayed 13 items.
- Vertex-disjoint subgraphs with high degree sums (Q322265) (← links)
- Complexity and kernels for bipartition into degree-bounded induced graphs (Q730002) (← links)
- 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)
- Disjoint cycles of different lengths in graphs and digraphs (Q1684653) (← links)
- On the existence of vertex-disjoint subgraphs with high degree sum (Q1693134) (← links)
- On partitions of graphs under degree constraints (Q2357778) (← links)
- Degree-constrained decompositions of graphs: Bounded treewidth and planarity (Q2369007) (← links)
- Bipartition of graph under degree constraints (Q2515316) (← links)
- Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs (Q2942649) (← links)
- A NOTE ON ALMOST BALANCED BIPARTITIONS OF A GRAPH (Q5245703) (← links)
- A Relaxed Version of the Erdős–Lovász Tihany Conjecture (Q5272646) (← links)