Find link

Find link is a tool written by Edward Betts.

searching for Supergraph 10 found (15 total)

alternate case: supergraph

Connected component (graph theory) (861 words) [view diff] exact match in snippet view article find links to article
other by paths, and which is connected to no additional vertices in the supergraph. For example, the graph shown in the illustration on the right has three
Epigraph (mathematics) (218 words) [view diff] exact match in snippet view article find links to article
In mathematics, the epigraph or supergraph of a function f : Rn→R is the set of points lying on or above its graph: The strict epigraph is the epigraph
Graph sandwich problem (522 words) [view diff] exact match in snippet view article find links to article
graphs, one of which must be a subgraph and the other of which must be a supergraph of the desired graph. Graph sandwich problems generalize the problem of
Graph bandwidth (1,021 words) [view diff] exact match in snippet view article find links to article
defined as one less than the maximum clique size in a proper interval supergraph of the given graph, chosen to minimize its clique size (Kaplan & Shamir
Clebsch graph (960 words) [view diff] exact match in snippet view article find links to article
and every four-chromatic induced subgraph of the Clebsch graph is a supergraph of the Grötzsch graph. More strongly, every triangle-free four-chromatic
Tree-depth (2,218 words) [view diff] exact match in snippet view article find links to article
numerical invariant of G, the minimum height of a Trémaux tree for a supergraph of G. This invariant and its close relatives have gone under many different
Glossary of graph theory (6,956 words) [view diff] exact match in snippet view article find links to article
subset of that of G restricted to this subset. In the other direction, a supergraph of a graph G is a graph of which G is a subgraph. We say a graph G contains
Pathwidth (7,461 words) [view diff] exact match in snippet view article find links to article
interval thickness (one less than the maximum clique size in an interval supergraph of G), vertex separation number, or node searching number. Pathwidth and
De Bruijn–Erdős theorem (graph theory) (2,575 words) [view diff] exact match in snippet view article find links to article
then there is a k-coloring of G in which each finite graph has a larger supergraph whose coloring agrees with the coloring of the whole graph. If a graph
Clique problem (7,700 words) [view diff] exact match in snippet view article find links to article
graph property (if a clique exists in a given graph, it will exist in any supergraph) there must exist a monotone circuit, using only and gates and or gates