#### Filter Results:

- Full text PDF available (31)

#### Publication Year

1997

2017

- This year (1)
- Last 5 years (26)
- Last 10 years (36)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani
- SIAM J. Discrete Math.
- 2003

List partitions generalize list colourings and list homomorphisms. Each symmetric matrix M over 0; 1; deenes a list partition problem. Diierent choices of the matrix M lead to many well-known graph the-oretic problems including the problem of recognizing split graphs and their generalizations, nding homogeneous sets, joins, clique cutsets, stable cutsets,… (More)

- Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani
- STOC
- 1999

We introduce a parametrized family of graph problems that includes several well-known graph partition problems as special czses. We develop tools which allow us to classify the complexity of many problems in this family, and in particular lead us to a complete classification for small values of the parameters. Along the way, we obtain a variety of specific… (More)

- Celina M. H. de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed
- J. Algorithms
- 2000

A skew partition as defined by Chvátal is a partition of the vertex set of a graph into four nonempty parts A B C D such that there are all possible edges between A and B and no edges between C and D. We present a polynomial-time algorithm for testing whether a graph admits a skew partition. Our algorithm solves the more general list skew partition problem,… (More)

- Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
- Theor. Comput. Sci.
- 2005

It is well known that a clique with k + 1 vertices is the only minimal obstruction to k-colourability of chordal graphs. A similar result is known for the existence of a cover by cliques. Both of these problems are in fact partition problems, restricted to chordal graphs. The first seeks partitions into k independent sets, and the second is equivalent to… (More)

- Márcia R. Cerioli, Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein
- Inf. Process. Lett.
- 1998

A homogeneous set is a non-trivial module of a graph, i.e. a nonempty, non-unitary, proper subset of a graph’s vertices such that all its elements present exactly the same outer neighborhood. Given two graphs G1(V, E1), G2(V, E2), the Homogeneous Set Sandwich Problem (HSSP) asks whether there exists a sandwich graph GS(V, ES), E1 ⊆ ES ⊆ E2, which has a… (More)

- Celina M. H. de Figueiredo, Luérbio Faria, Sulamita Klein, R. Sritharan
- Theor. Comput. Sci.
- 2007

- Andreas Brandstädt, Synara Brito, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
- Theor. Comput. Sci.
- 2013

- Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
- Annals OR
- 2005

In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r -cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic to Kr , with no edges joining any two of the subgraphs) equals the minimum number of cliques of G that meet all the r -cliques of G. When r = 1, this says that chordal graphs… (More)

- Hazel Everett, Sulamita Klein, Bruce A. Reed
- Discrete Applied Mathematics
- 1997

An (r, `)-partition of a graph G is a partition of its vertex set into r independent sets and ` cliques. A graph is (r, `) if it admits an (r, `)-partition. A graph is well-covered if every maximal independent set is also maximum. A graph is (r, `)-well-covered if it is both (r, `) and well-covered. In this paper we consider two different decision problems.… (More)