# Cograph

## Papers overview

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

2018

2018

- J. Comb. Optim.
- 2018

Tree representations of (sets of) symmetric binary relations, or equivalently edge-colored undirected graphs, are of centralâ€¦Â (More)

Is this relevant?

2012

2012

- Theor. Comput. Sci.
- 2012

Cograph Editing is to find for a given graph G = (V , E) a set of at most k edge additions and deletions that transform G into aâ€¦Â (More)

Is this relevant?

2010

2010

- 2010

In this paper, the median and the antimedian of cographs are discussed. It is shown that if G, and G2 are any two cographs, thenâ€¦Â (More)

Is this relevant?

2008

2008

- FAW
- 2008

A cograph completion of an arbitrary graph G is a cograph supergraph of G on the same vertex set. Such a completion is calledâ€¦Â (More)

Is this relevant?

2005

2005

- WG
- 2005

In this paper, we establish structural properties of cographs which enable us to present an algorithm which, for a cograph G andâ€¦Â (More)

Is this relevant?

2005

2005

- Discrete Applied Mathematics
- 2005

In this paper, we describe a new simple linear time algorithm to recognize cographs. Cographs are exactly the P4-free graphsâ€¦Â (More)

Is this relevant?

2003

2003

- Electr. J. Comb.
- 2003

The rank of the adjacency matrix of a graph is bounded above by the number of distinct non-zero rows of that matrix. In generalâ€¦Â (More)

Is this relevant?

1999

1999

- Journal of Graph Theory
- 1999

A graph is called a cograph contractionif it is obtained from a cograph (a graph with no induced path on four vertices) byâ€¦Â (More)

Is this relevant?

1993

1993

- J. Algorithms
- 1993

We present a parallel algorithm for recognizing cographs and constructing their cotrees. The algorithm takes O(log 2 n) time withâ€¦Â (More)

Is this relevant?

Highly Cited

1985

Highly Cited

1985

- SIAM J. Comput.
- 1985

Cographs are the graphs formed from a single vertex under the closure of the operations of union and complement. Anotherâ€¦Â (More)

Is this relevant?