Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2016

Highly Cited

2016

In 1960 Berge came up with the concept of perfect graphs, and in doing so, conjectured some characteristics about them. A perfect… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

A graph is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one. In this paper we… Expand

Is this relevant?

2003

2002

2002

A graph is perfect if, in all its induced subgraphs, the size of a largest clique is equal to the chromatic number. Examples of… Expand

Is this relevant?

1989

1989

Abstract A graph G is perfect if for every induced subgraph F of G , the chromatic number χ ( F ) equals the largest number ω ( F… Expand

Is this relevant?

1987

1987

Abstract Perfect Graphs were defined by Claude Berge in 1961. Since that time this class of graphs has been intensely studied… Expand

Is this relevant?

1987

1987

Abstract This note proves the Strong Perfect Graph Conjecture for ( K 4 − e )-free graphs from first principles. The proof… Expand

Is this relevant?

1986

1986

We present a distributed protocol for achieving a distributed coin in the presence of an extremely powerful adversary in constant… Expand

Is this relevant?

1979

1979

Abstract When α, ω are positive integers, we set n = αω + 1 and look for zero-one matrices X, Y of size n × n such that XY= YX… Expand

Is this relevant?

Highly Cited

1974

Highly Cited

1974

A zero–one matrix is called perfect if the polytope of the associated set packing problem has integral vertices only. By this… Expand

Is this relevant?