18 search results - page 4 / 4 » combinatorica 2006 |
COMBINATORICA
2006
14 years 10 months ago
2006
In this paper we show that, if G is a Berge graph such that neither G nor its complement G contains certain induced subgraphs, named proper wheels and long prisms, then either G i...
DM
2006
14 years 10 months ago
2006
The notion of the carvingwidth of a graph was introduced by Seymour and Thomas [Call routing and the ratcatcher, Combinatorica
90
Voted
COMBINATORICA
2006
14 years 10 months ago
2006
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...