subdivision graph

subdivision graph
мат. граф подразделений

Большой англо-русский и русско-английский словарь. 2001.

Игры ⚽ Нужно решить контрольную?

Смотреть что такое "subdivision graph" в других словарях:

  • Subdivision — may refer to: *Country subdivision **Subdivision (land), a term for an urban or sub urban area, especially if recently parcelled up into smaller plots for new uses **Census subdivision, a term used in Canada *Subdivision surface, a term in… …   Wikipedia

  • Homeomorphism (graph theory) — In graph theory, two graphs G and G are homeomorphic if there is an isomorphism from some subdivision of G to some subdivision of G . If the edges of a graph are thought of as lines drawn from one vertex to another (as they are usually depicted… …   Wikipedia

  • Planar graph — Example graphs Planar Nonplanar Butterfly graph K5 The complete graph K4 …   Wikipedia

  • Outerplanar graph — A maximal outerplanar graph and its 3 coloring. In graph theory, an undirected graph is an outerplanar graph if it can be drawn in the plane without crossings in such a way that all of the vertices belong to the unbounded face of the drawing.… …   Wikipedia

  • Hadwiger conjecture (graph theory) — In graph theory, the Hadwiger conjecture (or Hadwiger s conjecture) states that, if an undirected graph G requires k or more colors in any vertex coloring, then one can find k disjoint connected subgraphs of G such that each subgraph is connected …   Wikipedia

  • Heawood graph — infobox graph name = Heawood graph image caption = namesake = Percy John Heawood vertices = 14 edges = 21 girth = 6 chromatic number = 2 chromatic index = 3 properties = Cubic Cage Distance regular ToroidalIn the mathematical field of graph… …   Wikipedia

  • Minor (graph theory) — In graph theory, an undirected graph H is called a minor of the graph G if H is isomorphic to a graph that can be obtained by zero or more edge contractions on a subgraph of G. The theory of graph minors began with Wagner s theorem that a graph… …   Wikipedia

  • Complete graph — K7, a complete graph with 7 vertices Vertices n Edges …   Wikipedia

  • Desargues graph — Named after Gérard Desargues Vertices 20 Edges 30 …   Wikipedia

  • Möbius–Kantor graph — Named after August Ferdinand Möbius and S. Kantor Vertices 16 …   Wikipedia

  • Planar straight-line graph — (PSLG) is a term used in computational geometry for an embedding of a planar graph in the plane such that its edges are mapped into straight line segments. [cite book author = Franco P. Preparata and Michael Ian Shamos | title = Computational… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»