Find link

Find link is a tool written by Edward Betts.

searching for Supergraph 8 found (13 total)

alternate case: supergraph

Clebsch graph (984 words) [view diff] exact match in snippet view article find links to article

four-chromatic induced subgraph of the Clebsch graph is a supergraph of the Grötzsch graph. More strongly, every triangle-free
Connected component (graph theory) (872 words) [view diff] exact match in snippet view article find links to article
is connected to no additional vertices in the supergraph. For example, the graph shown in the illustration
Glossary of graph theory (6,938 words) [view diff] exact match in snippet view article find links to article
restricted to this subset. In the other direction, a supergraph of a graph G is a graph of which G is a subgraph
Graph sandwich problem (522 words) [view diff] exact match in snippet view article find links to article
be a subgraph and the other of which must be a supergraph of the desired graph. Graph sandwich problems
Tree-depth (2,062 words) [view diff] exact match in snippet view article find links to article
G, the minimum height of a Trémaux tree for a supergraph of G. This invariant and its close relatives
Pathwidth (7,522 words) [view diff] exact match in snippet view article find links to article
one can find an interval supergraph of G, and for every interval supergraph of G one can find a path
De Bruijn–Erdős theorem (graph theory) (2,479 words) [view diff] exact match in snippet view article find links to article
of G in which each finite graph has a larger supergraph whose coloring agrees with the coloring of the
Clique problem (7,731 words) [view diff] exact match in snippet view article find links to article
exists in a given graph, it will exist in any supergraph) there must exist a monotone circuit, using only