7 citations · 8 across the 10 of their papers we have counts for
1 paper · 2 filters
András Gyárfás, Márton Marits, Géza Tóth
We study how many comparability subgraphs are needed to partition the edge set of a perfect graph. We show that many classes of perfect graphs can be partitioned into (at most) two…