253 search results - page 3 / 51 » Perfection thickness of graphs |
WG
2001
Springer
13 years 11 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
13 years 7 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),...
CCCG
2010
13 years 7 months ago
2010
DM
2010
13 years 7 months ago
2010
DAM
2008
13 years 7 months ago
2008
We discuss some new and old results about skew partitions in perfect graphs.