… question: for a given graph G and graph class G, is there a partial complement of G which
is … of the graphs class G, such as bipartite, degenerate, or cographs. We complement these …

… a graph Pos,~ consisting of all nonempty partial orders on {1 ..... n} with edges denoting
complementation. We investigate here properties of the graphs Pos,~. In particular, we show: …

… many graph-valued operations within the study of graph theory… on graphs that produces
the complement G of the graph G. … for a graph to be isomorphic to its switched graph at one of …

… local complementation and local equivalence for simple graphs… The operation of local
complementation of a simple graph G … It arose there in connection with the following partial case of …

… algorithms are partially driven by the problems of recognizing of graph classes which differ
only up … In this paper we study the subgraph complement of a graph, which was introduced by …

… by allowing multiple subsequent partial complements. Our … partial complements we allow,
for various graph families. We show that a partial complement alters the rank-width of a graph …

… We also prove that 4 is the least integer k such that every graph G having a large number n
… Next, we give partial description of the set S of ordered pairs (v,k) such that two graphs G and …

… of many properties of the complement in linear time, instead … graphs and digraphs. An
outward complementation operation is where only the outgoing arcs of a vertex are complemented…

… results on partial k-trees to establish the graph complement … is to verify that the graph
complement conjecture (and its … , for certain classes of partial k-trees, and for small graphs. Much …

… [10] Let G + S be a partial complement of a graph G and S be an induced subset of a vertex
set of graph G. Then partial complement adjacency matrix of graph G+S is an × n matrix …