Complement graph

Known as: Graph complement, Complement (graph theory), Inverse graph

In graph theory, the complement or inverse of a graph G is a graph H on the same vertices such that two distinct vertices of H are adjacent if and…

Papers overview

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

2016

This paper presents the results of two explorations: one, exhaustive, of the graph sets from 4 to 10 vertices, and other, using…

2013

A vertex-colored graph G is rainbow vertex-connected if any two vertices are connected by a path whose internal vertices have…

2010

The Berge conjecture was proven by Chudnovsky, Robertson, Seymour and Thomas in a paper of 146 pages long (see [1]); in this…

2009

. We consider the feasibility problem OPP in higher-dimensional orthogonal packing: given a set of d -dimensional ( d ≥ 2…

2006

2002

In the first chapter of my lecture I will discuss applications of probabilistic methods to RAMSAY’S theorem, next I will speak an…

1995

We present a distributed garbage collection algorithm that eventually collects all cycles in an open network. As with recent…

1990

The foundation of a geometric theory for robust stabilization of infinite-dimensional time-varying linear systems is presented…

1989

Let G(V, E) be a simple graph, A_T(?)VUE. A_T is called a total covering of G, if (?)x∈VUE, it holds that x∈A_T or xy∈A_T(y∈V\A_T…

1980