In graph theory and computer science, the graph sandwich problem is a problem of finding a graph that belongs to a particular family of graphs and isâ€¦Â (More)

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

2015

2015

- PESQUISA OPERACIONAL, Fernanda Couto, LuÃ©rbio Faria, Sylvain Gravier, Sulamita Klein, Vinicius F. Santos
- 2015

A cograph is a graph without induced P4 (where P4 denotes an induced path with 4 vertices). A graph G is (k, ) if its vertex setâ€¦Â (More)

Is this relevant?

2015

2015

A cograph is a graph without induced P4 (where P4 denotes an induced path with 4 vertices). A graph G is (k, `) if its vertex setâ€¦Â (More)

Is this relevant?

2014

2014

- Fernanda Couto, LuÃ©rbio Faria, Sulamita Klein
- Journal of the Brazilian Computer Society
- 2014

In this work, we consider the graph sandwich decision problem for property Î , introduced by Golumbic, Kaplan and Shamir: givenâ€¦Â (More)

Is this relevant?

2011

2011

- Simone Dantas, Celina M. H. de Figueiredo, Martin Charles Golumbic, Sulamita Klein, FrÃ©dÃ©ric Maffray
- Annals OR
- 2011

The chain graph sandwich problem asks: Given a vertex set V , a mandatory edge set E1, and a larger edge set E2, is there a graphâ€¦Â (More)

Is this relevant?

2009

2009

- Simone Dantas, Sulamita Klein, CÃ©lia Picinin de Mello, Aurora Morgana
- Discrete Mathematics
- 2009

The P4-sparse Graph Sandwich Problem asks, given two graphs G 1 = (V, E1) and G2 = (V, E2), whether there exists a graph G = (Vâ€¦Â (More)

Is this relevant?

2007

2007

- Sandra Maria Mendes de Moura Dantas, Lester de Abreu Faria
- 2007 International Multi-Conference on Computingâ€¦
- 2007

The stubborn partition is a partition of the vertex set of a graph G into at most four parts A, B, C, D, with the followingâ€¦Â (More)

Is this relevant?

2005

2005

- Simone Dantas, Sulamita Klein, CÃ©lia Picinin de Mello, Aurora Morgana
- Electronic Notes in Discrete Mathematics
- 2005

The P4-sparse Graph Sandwich Problem asks, given two graphs G 1 = (V,E) and G = (V,E), whether there exists a graph G = (V,Eâ€¦Â (More)

Is this relevant?

2000

2000

- Celina M. H. de Figueiredo, Sulamita Klein, Kristina Vuskovic
- Electronic Notes in Discrete Mathematics
- 2000

A graph is a 1-join composition if its vertex set can be partitioned into four nonempty sets AL; AR ; SL and SR such that: everyâ€¦Â (More)

Is this relevant?

Review

1995

Review

1995

- Martin Charles Golumbic
- CTW
- 1995

A sandwich problem for a graph with respect to a graph property Î is a partially specified graph, i.e., only some of the edgesâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- Martin Charles Golumbic, Ron Shamir
- J. ACM
- 1993

Temporal events are regarded here as intervals on a time line. This paper deals with problems in reasoning about such intervalsâ€¦Â (More)

Is this relevant?