Pages that link to "Item:Q2419120"
From MaRDI portal
The following pages link to Degree-constrained 2-partitions of graphs (Q2419120):
Displaying 12 items.
- Complexity and kernels for bipartition into degree-bounded induced graphs (Q730002) (← links)
- \(2K_{2}\) vertex-set partition into nonempty parts (Q966027) (← links)
- Partitions of graphs with high minimum degree or connectivity. (Q1405098) (← links)
- Graph partitions with minimum degree constraints (Q1584392) (← links)
- Partitioning a graph into degenerate subgraphs (Q2011133) (← links)
- Partitions of graphs and multigraphs under degree constraints (Q2181223) (← links)
- On partitions of graphs under degree constraints (Q2357778) (← links)
- Bipartition of graph under degree constraints (Q2515316) (← links)
- On the computational complexity of the bipartizing matching problem (Q2675722) (← links)
- Partitioning a Graph into Highly Connected Subgraphs (Q3188667) (← links)
- Partitions of hypergraphs under variable degeneracy constraints (Q6055378) (← links)
- Near-bipartiteness, connected near-bipartiteness, independent feedback vertex set and acyclic vertex cover on graphs having small dominating sets (Q6606167) (← links)
