Pages that link to "Item:Q516874"
From MaRDI portal
The following pages link to The complexity of partitioning into disjoint cliques and a triangle-free graph (Q516874):
Displaying 7 items.
- Improved FPT algorithms for weighted independent set in bull-free graphs (Q1685998) (← links)
- Partitioning a graph into disjoint cliques and a triangle-free graph (Q2352776) (← links)
- On NP-hardness of the clique partition -- independence number gap recognition and related problems (Q2368935) (← links)
- The disjoint cliques problem (Q4345417) (← links)
- (Q4731217) (← links)
- (Q5009615) (← links)
- Solving Partition Problems Almost Always Requires Pushing Many Vertices Around (Q5220192) (← links)