Search results

{{short description|Graph representing structure of another graph's cliques}} ...r|G}} is another graph {{math|''K''(''G'')}} that represents the structure of [[clique (graph theory)|cliques]] in {{mvar|G}}. ...

{{Short description|Subfield of graph theory}} ...as "the theory of geometric and topological graphs" (Pach 2013). Geometric graphs are also known as [[spatial network]]s. ...

...every planar graph could be represented as the intersection graph of a set of simple curves in the plane ...aight line segments and [[graph theory|edges]] of ''G'' are represented by intersection points. ...

...ph. Indeed, the other green edge with three black edges would form a cycle of length four with no chords.]] ...a chordal completion of a graph is typically called a '''triangulation''' of that graph. ...

{{Short description|Intersection graph of a chord diagram}} ...ices can be associated with a finite system of [[Chord (geometry)|chords]] of a [[circle]] such that two vertices are adjacent if and only if the corresp ...

...resentation of some structure ''X'' is a structure ''Y'' that is the image of ''X'' under a [[homomorphism]] that preserves ''Π''. The label ''representa ...ting of elements of [[algebraic structures]] by [[linear transformations]] of [[vector spaces]].<ref name=":0" /> ...

{{Short description|Intersection graph of unit disks in the plane}} [[Image:Unit disk graph.svg|thumb|A collection of unit circles and the corresponding unit disk graph.]] ...

...nar graph|planar drawing]] for which all vertices belong to the outer face of the drawing. ...raphs may be characterized (analogously to [[Wagner's theorem]] for planar graphs) by the two [[forbidden minor]]s {{math|''K''₄}} and {{math|''K' ...

...(discrete mathematics)|graph]] whose deletion increases the graph's number of [[Connected component (graph theory)|connected components]].<ref>{{citation ...vertices; see [[Glossary of graph theory#bridge|bridge]] in the [[Glossary of graph theory]]. ...

{{Short description|Intersection graph for intervals on the real number line}} ...ry]], an '''interval graph''' is an [[undirected graph]] formed from a set of [[Interval (mathematics)|intervals]] on the [[real line]], ...

{{Short description|Method of graph decomposition}} ...nds]] and [[clique (graph theory)|clique]] [[minor (graph theory)|minors]] of [[infinite graph]]s.<ref name="rst91">{{citation ...

{{Short description|Unrelated vertices in graphs}} ...contains. Independent sets have also been called "internally stable sets", of which "stable set" is a shortening.<ref>{{harvtxt|Korshunov|1974}}</ref> ...

[[File:Junction-tree-example.gif|300px|thumb|Example of a junction tree]] ...classes of queries can be compiled at the same time into larger structures of data.<ref name=":1" /> There are different [[algorithm]]s to meet specific ...

...ike?'" (Howie 2002). The relations are useful for understanding the nature of divisibility in a semigroup; they are also valid for [[Group (mathematics)| ...ome semigroup element do indeed contain that element. For an element ''a'' of ''S'', the relevant ideals are: ...

...isjoint union]]. That is, the family of cographs is the smallest class of graphs that includes ''K''₁ and is closed under complementation and dis ...cey Jr. on [[orthomodular lattice]]s),{{sfnp|Sumner|1974}} and '''2-parity graphs'''.{{sfnp|Burlet|Uhry|1984}} ...

...ed that all (formal) [[formal language|languages]] with interactive proofs of arbitrary length with private coins also have interactive proofs with publi ...enever the answer is "no", Arthur will never accept more than {{frac|1|3}} of the time. Thus, Arthur acts as a probabilistic polynomial-time verifier, as ...

...a special case of the [[forbidden subgraph problem]] on the maximum number of edges in a graph that does not have a given subgraph. ...of edges among all {{math|''K''_''r''+1}}-free {{mvar|n}}-vertex graphs. ...

{{Short description|Adjacent subset of an undirected graph}} ...wo dark blue 4-cliques are both maximum and maximal, and the clique number of the graph is 4.]] ...

{{Short description|Set of edges without common vertices}} {{for|comparisons of two graphs|Graph matching}} ...

{{short description|Class of problems solvable in polynomial time}} ...solved by a [[deterministic Turing machine]] using a [[polynomial]] amount of [[computation time]], or [[polynomial time]]. ...