Некатегоризованные страницы

Материал из WikiGrapp
Перейти к:навигация, поиск

Ниже показано до 250 результатов в диапазоне от 1 до 250.

Просмотреть (предыдущие 250 | следующие 250) (20 | 50 | 100 | 250 | 500)

  1. "Brute force" method
  2. (Abstract) syntax representation
  3. (Informationally) connected operands
  4. (Informationally) incompatible operands
  5. (L,Y)-Bunch
  6. (L,Y)-Связка
  7. (Strong) equivalence of schemas
  8. (X,Y)-Intersection graphs
  9. (X,Y)-Графы пересечений
  10. (a,b)-Cut
  11. (a,b)-Linear class of graphs
  12. (a,b)-Panconnected graph
  13. (a,b)-Planar graph
  14. (a,b)-Separator
  15. (a,b)-Vertex pancyclic graph
  16. (a,b)-Плоский граф
  17. (a,d)-Edge-antimagic total graph
  18. (a,d)-Edge-antimagic total labeling
  19. (a,d)-Face antimagic graph
  20. (g,f)-Factor
  21. (g,f)-Factorization
  22. (g,f)-Graph
  23. (k,d)-Arithmetic graph
  24. (k,d)-Arithmetic numbering
  25. (k,d)-Coloring
  26. (k,d)-Раскраска
  27. (k,g)-Cage
  28. (p,q)-Graceful signed graph
  29. (r,s)-Regular graph
  30. (t,i,j)-Cover
  31. (Абстрактное) синтаксическое дерево
  32. (Абстрактное) синтаксическое представление
  33. 0-Chain of a graph
  34. 0-Цепь графа
  35. 1-2-Братское дерево
  36. 1-2 Brother tree
  37. 1-Base
  38. 1-Chain of a graph
  39. 1-Chordal graph
  40. 1-Factor
  41. 1-Factorization of K 2n
  42. 1-Tree
  43. 1-edge hamiltonian graph
  44. 1-База
  45. 1-Дерево
  46. 1-Цепь графа
  47. 2-3-Tree
  48. 2-3-Дерево
  49. 2-3 Brother tree
  50. 2-Connected graph
  51. 2-Packing number
  52. 2-Packing of a graph
  53. 2-Pebbling property
  54. 2-Section graph
  55. 2-Switch
  56. 2-Секционный граф
  57. 3-Combination problem
  58. 3-set exact cover problem
  59. 3-Раскрашиваемость
  60. 5-Flow conjecture
  61. A-reprezentation of a cf-graph
  62. A-граф
  63. A-представление уграфа
  64. ANC-Грамматика
  65. AT-Free graph
  66. AVL-Tree
  67. Abdiff-tolerance competition graph
  68. Absolute hypergraph
  69. Absolute incenter
  70. Absolute inner radius
  71. Absolute median
  72. Absolute of a rooted tree
  73. Absolute outcenter
  74. Absolute outer radius
  75. Absolute retract
  76. Absorbant set
  77. Absorbent set
  78. Abstract computer
  79. Abstract graph
  80. Abstract machine
  81. Abstract syntax tree
  82. Acceptable assignment
  83. Access term
  84. Achromatic number
  85. Achromatic status
  86. Ackermann's function
  87. Acyclic chromatic number
  88. Acyclic colouring
  89. Acyclic dominating set
  90. Acyclic domination number
  91. Acyclic orientation
  92. Additive hereditary graph property
  93. Addressable transformation graph
  94. Addressing scheme
  95. Adjacency
  96. Adjacency list
  97. Adjacency matrix
  98. Adjacency operator
  99. Adjacency property
  100. Adjacent arcs
  101. Adjacent edges
  102. Adjacent faces
  103. Adjacent forest graph
  104. Adjacent graphs
  105. Adjacent vertices
  106. Adjoint digraph
  107. Admissible sequence
  108. Advancing arc
  109. Algebraic connectivity
  110. Algebraic graph theory
  111. Algorithm
  112. Alive Petri net
  113. Almost 3-regular
  114. Almost cubic graph
  115. Alpha-Acyclic hypergraph
  116. Alpha-Approximable problem
  117. Alpha-Cyclic hypergraph
  118. Alphabet
  119. Alt
  120. Alternating chain
  121. Amalgam
  122. Amalgamation of a graph
  123. Amallamorphic graphs
  124. Amount of a flow
  125. Anarboricity of a graph
  126. Ancestor of a vertex
  127. Animal
  128. Annihilator
  129. Anti-gem
  130. Antichain
  131. Anticlique
  132. Antidependence
  133. Antidirected Hamiltonian cycle
  134. Antidirected Hamiltonian path
  135. Antidirected path
  136. Antihole
  137. Antimagic graph
  138. Antiparallel arcs
  139. Antiprism
  140. Antisymmetric graph
  141. Antisymmetric relation
  142. Apex graph
  143. Approximate point spectrum
  144. Approximation algorithm
  145. Arbitrarily hamiltonian graph
  146. Arbitrarily traceable graph
  147. Arbitrarily traverseable graph
  148. Arbitrarily vertex decomposable graph
  149. Arboreal hypergraph
  150. Arborescence
  151. Arboricity of a graph
  152. Arc-forwarding index
  153. Arc base
  154. Argument
  155. Arithmetic graph
  156. Arrangeable alt
  157. Arrangement
  158. Articulation point
  159. Articulation set
  160. Assignment problem
  161. Associated Cayley digraph
  162. Associated undirected graph
  163. Associative search
  164. Asteroidal number
  165. Asteroidal set
  166. Asteroidal triple
  167. Asymmetric graph
  168. Asymmetric relation
  169. Atomic formula
  170. Attachment graph
  171. Attribute grammar
  172. Attribute tree
  173. Augmented adjacency matrix
  174. Augmenting chain
  175. Automata theory
  176. Automorphism
  177. Automorphism group
  178. Automorphism problem
  179. Average connectivity
  180. Average domination number
  181. Average independent domination number
  182. B-Tree
  183. B-Дерево
  184. BB-Tree
  185. BB-Дерево
  186. Back-edge
  187. Backbone
  188. Backbone coloring
  189. Backbone coloring number
  190. Backward arc
  191. Balance of a vertex
  192. Balanced circuit
  193. Balanced digraph
  194. Balanced graph
  195. Balanced hypergraph
  196. Balanced signed graph
  197. Ball number
  198. Bandwidth
  199. Bandwidth sum
  200. Bar-visibility graph
  201. Base digraph
  202. Base of a directed graph
  203. Base of a matroid
  204. Based graph
  205. Basic block
  206. Basic cycle
  207. Basic cycle set
  208. Basic numberings
  209. Basis number
  210. Basis of a digraph
  211. Bayesian network
  212. Beraha number
  213. Berge's Formula
  214. Berge's complete graph
  215. Berge's conjecture
  216. Berge graph
  217. Bi-Helly family
  218. Biblock
  219. Bicenter
  220. Bicenter tree
  221. Bicentre
  222. Bicentroid of a tree
  223. Bichordal bipartite graph
  224. Bichromatic graph
  225. Bichromatic hypergraph
  226. Biclique
  227. Biclique edge cover
  228. Biclique edge covering number
  229. Biclique number
  230. Bicoloured subgraph
  231. Bicomponent
  232. Biconnected component
  233. Biconvex bipartite graph
  234. Bicritical graph
  235. Bicubic graph
  236. Bidirectional arcs
  237. Bifurcant
  238. Bigraph
  239. Bihypergraph
  240. Binary Hamming graph
  241. Binary de Bruijn graph
  242. Binary matroid
  243. Binary n-dimensional cube
  244. Binary relation
  245. Binary search tree
  246. Binary sorting tree
  247. Binary split tree
  248. Binary tree
  249. Binary vertex
  250. Binode

Просмотреть (предыдущие 250 | следующие 250) (20 | 50 | 100 | 250 | 500)