55 search results - page 1 / 11 » A class of perfectly contractile graphs |
JCT
2006
13 years 10 months ago
2006
We consider the class A of graphs that contain no odd hole, no antihole, and no "prism" (a graph consisting of two disjoint triangles with three disjoint paths between th...
SIAMDM
2008
13 years 10 months ago
2008
We consider the class of graphs that contain no bull, no odd hole, and no antihole of length at least five. We present a new algorithm that colors optimally the vertices of every g...
GC
2007
Springer
13 years 10 months ago
2007
Springer
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
DM
1998
13 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),...
COCO
2010
Springer
13 years 8 months ago
2010
Springer
An even cycle in a graph is called nice by Lov