The following pages link to Generalized partitions of graphs (Q1283792):
Displaying 23 items.
- The complexity of partitioning into disjoint cliques and a triangle-free graph (Q516874) (← links)
- Restrictions of graph partition problems. I (Q672380) (← links)
- Partitions of large Rado graphs (Q834717) (← links)
- NP-hard and linear variants of hypergraph partitioning (Q1041217) (← links)
- A polynomial characterization of some graph partitioning problems (Q1108810) (← links)
- On a graph partition problem with application to VLSI layout (Q1199941) (← links)
- Computational aspects of greedy partitioning of graphs (Q1702844) (← links)
- Vertex set partitions preserving conservativeness (Q1850496) (← links)
- Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard (Q1883661) (← links)
- More aspects of arbitrarily partitionable graphs (Q2158201) (← links)
- On the complexity of partitioning a graph into a few connected subgraphs (Q2352361) (← links)
- Partitioning a graph into disjoint cliques and a triangle-free graph (Q2352776) (← links)
- On the minimum monochromatic or multicolored subgraph partition problems (Q2456352) (← links)
- Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees (Q2479574) (← links)
- General introduction to graph partitioning (Q2912413) (← links)
- Partitions of Graphs (Q3064394) (← links)
- (Q3222889) (← links)
- On the computational complexity of (O,P)-partition problems (Q4210668) (← links)
- Packing $k$-Matchings and $k$-Critical Graphs (Q4602858) (← links)
- The complexity for partitioning graphs by monochromatic trees, cycles and paths (Q4652867) (← links)
- A Partially Ordered Structure and a Generalization of the Canonical Partition for General Graphs with Perfect Matchings (Q4909525) (← links)
- (Q5705841) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902528) (← links)
