Searching for "Hardly perfect graphs." – sorted by Relevance.
-
Packing Cuts in Undirected Graphs
- graphs. Whether Cut Packing is NP-hard for perfect graphs is an open problem. Here we show that Cut
- Cited by 4 (2 self) – Add To MetaCart

