Pages that link to "Item:Q2352776"
From MaRDI portal
The following pages link to Partitioning a graph into disjoint cliques and a triangle-free graph (Q2352776):
Displaying 8 items.
- The complexity of partitioning into disjoint cliques and a triangle-free graph (Q516874) (← links)
- Generalized partitions of graphs (Q1283792) (← links)
- Improved FPT algorithms for weighted independent set in bull-free graphs (Q1685998) (← links)
- Computational aspects of greedy partitioning of graphs (Q1702844) (← links)
- Vertex partitions of graphs into cographs and stars (Q2874091) (← links)
- (Q4726289) (← links)
- (Q5009615) (← links)
- Solving Partition Problems Almost Always Requires Pushing Many Vertices Around (Q5220192) (← links)