Sciweavers

61
Voted
SIAMDM
2000
77views more  SIAMDM 2000»
14 years 8 months ago
Recognizing Perfect 2-Split Graphs
A graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph is a k-split graph if its vertices can be partitioned into k sets, each of which...
Chính T. Hoàng, Van Bang Le
CP
2008
Springer
14 years 10 months ago
Perfect Constraints Are Tractable
By using recent results from graph theory, including the Strong Perfect Graph Theorem, we obtain a unifying framework for a number of tractable classes of constraint problems. Thes...
András Z. Salamon, Peter G. Jeavons