483 search results - page 2 / 97 » On perfectness of sums of graphs |
91
Voted
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
69
Voted
SIAMDM
2000
14 years 10 months ago
2000
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...
74
Voted
WG
2001
Springer
15 years 2 months ago
2001
Springer
We call an edge e of a perfect graph G critical if G − e is imperfect and say further that e is anticritical with respect to the complementary graph G. We ask in which perfect gr...
DM
1998
14 years 10 months ago
1998
Let β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upper irredundance number, respectively. A graph G is called Γperfect if β(H) = Γ(H),...
65
Voted
DAM
2008
14 years 10 months ago
2008
We discuss some new and old results about skew partitions in perfect graphs.