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

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

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

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

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

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

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