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

Перейти к навигации Перейти к поиску

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

Просмотреть ( | ) (20 | 50 | 100 | 250 | 500)

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

Просмотреть ( | ) (20 | 50 | 100 | 250 | 500)

Источник — http://pco.iis.nsk.su/grapp/index.php/Служебная:Некатегоризованные_страницы