Find link

language:

Find link is a tool written by Edward Betts.

searching for Supergraph 16 found (19 total)

alternate case: supergraph

Glossary of graph theory (15,599 words) [view diff] exact match in snippet view article find links to article

completion of a given graph is a supergraph that has some desired property. For instance, a chordal completion is a supergraph that is a chordal graph. 3. A

Graph sandwich problem (524 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

Epigraph (mathematics) (1,500 words) [view diff] exact match in snippet view article

In mathematics, the epigraph or supergraph of a function f:X→[−∞,∞]{\displaystyle f:X\to [-\infty ,\infty ]} valued in the extended real numbers [−∞

Graph bandwidth (1,300 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

Tree-depth (2,760 words) [view diff] exact match in snippet view article find links to article

invariant of G{\displaystyle G}, the minimum height of a Trémaux tree for a supergraph of G{\displaystyle G}. This invariant and its close relatives have gone

Pathwidth (7,618 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

Semi-Yao graph (328 words) [view diff] exact match in snippet view article find links to article

θ{\displaystyle \theta } and an appropriate cone axis, the k-SYG gives a supergraph of the k-nearest neighbor graph (k-NNG). For example, in 2D, if we partition

Clebsch graph (1,129 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

Unit distance graph (3,990 words) [view diff] exact match in snippet view article find links to article

G{\displaystyle G} is not a non-strict unit distance graph, neither is any supergraph H{\displaystyle H} of G{\displaystyle G}. A similar idea works for strict

Aanderaa–Karp–Rosenberg conjecture (3,549 words) [view diff] exact match in snippet view article find links to article

every supergraph of this graph on the same vertex set also possesses it. For instance, the property of being nonplanar is monotone: a supergraph of a nonplanar

Interval graph (2,614 words) [view diff] exact match in snippet view article find links to article

subgraph. The parameterized version of interval completion (find an interval supergraph with k additional edges) is fixed parameter tractable, and moreover, is

Kinetic closest pair (1,039 words) [view diff] exact match in snippet view article find links to article

Delaunay triangulations, so called Equilateral Delaunay graph (EDG), is a supergraph for the nearest neighbor graph (NNG); the endpoints of the edge with minimum

Dense subgraph (1,335 words) [view diff] exact match in snippet view article find links to article

density in its local region in the graph: it is neither contained in any supergraph with the same or larger density, nor it contains subgraphs with density

De Bruijn–Erdős theorem (graph theory) (3,630 words) [view diff] exact match in snippet view article

-coloring of G {\displaystyle G} in which each finite graph has a larger supergraph whose coloring agrees with the coloring of the whole graph. If a graph

Georg Glaeser (649 words) [view diff] exact match in snippet view article find links to article

Teubner, 1986. Objektorientiertes Graphik-Programmieren mit der Pascal Unit Supergraph. Teubner, 1992. Amiga 3D-Sprinter. Pearson Education, 1993. Glaeser, Georg

Clique problem (9,876 words) [view diff] exact match in snippet view article find links to article

meaning that, if a clique exists in a given graph, it will exist in any supergraph. Because this property is monotone, there must exist a monotone circuit