Cograph

Known as: P 4-free graph, P4 free graph, P4-free graph 
In graph theory, a cograph, or complement-reducible graph, or P4-free graph, is a graph that can be generated from the single-vertex graph K1 by… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Tree representations of (sets of) symmetric binary relations, or equivalently edge-colored undirected graphs, are of central… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
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)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
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
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)
  • figure 1
Is this relevant?
2005
2005
In this paper, we establish structural properties of cographs which enable us to present an algorithm which, for a cograph G and… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
In this paper, we describe a new simple linear time algorithm to recognize cographs. Cographs are exactly the P4-free graphs… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
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
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
We present a parallel algorithm for recognizing cographs and constructing their cotrees. The algorithm takes O(log 2 n) time with… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Cographs are the graphs formed from a single vertex under the closure of the operations of union and complement. Another… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?