Pages that link to "Item:Q881575"

The following pages link to Efficient algorithms for decomposing graphs under degree constraints (Q881575):

Displaying 20 items.

• On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities (Q456174) (← links)
• Improper C-colorings of graphs (Q629357) (← links)
• Complexity and kernels for bipartition into degree-bounded induced graphs (Q730002) (← links)
• Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
• On the existence of vertex-disjoint subgraphs with high degree sum (Q1693134) (← links)
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
• Partitions of multigraphs under minimum degree constraints (Q1730245) (← links)
• An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) (Q1751097) (← links)
• A generalization of Stiebitz-type results on graph decomposition (Q2034069) (← links)
• Partitions of multigraphs without \(C_4\) (Q2053675) (← links)
• Partitions of graphs and multigraphs under degree constraints (Q2181223) (← links)
• A note on partitions of graphs under degree constraints (Q2192117) (← links)
• On partitions of graphs under degree constraints (Q2357778) (← links)
• Degree-constrained decompositions of graphs: Bounded treewidth and planarity (Q2369007) (← links)
• Degree-constrained 2-partitions of graphs (Q2419120) (← links)
• On a conjecture of Schweser and Stiebitz (Q2661211) (← links)
• On connected partition with degree constraints (Q2666577) (← links)
• Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs (Q2942649) (← links)
• (Q5002797) (← links)
• Graph partitions under average degree constraint (Q6187347) (← links)