1294
правки
Glk (обсуждение | вклад) (Новая страница: «'''Apex graph''' --- вершинный граф. An '''apex graph''' is a graph <math>G</math> that has a vertex <math>v \in V(G)</math> such that <math>G \se…») |
KVN (обсуждение | вклад) Нет описания правки |
||
Строка 1: | Строка 1: | ||
'''Apex graph''' | '''Apex graph''' — ''[[вершинный граф]].'' | ||
An '''apex graph''' is a | An '''apex graph''' is a [[graph, undirected graph, nonoriented graph|graph]] <math>\,G</math> that has a [[vertex]] <math>v \in V(G)</math> such that <math>G \setminus \{v\}</math> | ||
graph <math>G</math> that has a vertex <math>v \in V(G)</math> such that <math>G \setminus \{v\}</math> | is ''[[planar graph|planar]]''. | ||
is '' planar''. |