Страницы без интервики-ссылок

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

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 graph
92. Acyclic orientation
93. Additive hereditary graph property
94. Addressable transformation graph
95. Addressing scheme
96. Adjacency
97. Adjacency list
98. Adjacency matrix
99. Adjacency operator
100. Adjacency property
101. Adjacent arcs
102. Adjacent edges
103. Adjacent faces
104. Adjacent forest graph
105. Adjacent graphs
106. Adjacent vertices
107. Adjoint digraph
108. Admissible sequence
109. Advancing arc
110. Algebraic connectivity
111. Algebraic graph theory
112. Algorithm
113. Alive Petri net
114. Almost 3-regular
115. Almost cubic graph
116. Alpha-Acyclic hypergraph
117. Alpha-Approximable problem
118. Alpha-Cyclic hypergraph
119. Alphabet
120. Alt
121. Alternating chain
122. Amalgam
123. Amalgamation of a graph
124. Amallamorphic graphs
125. Amount of a flow
126. Anarboricity of a graph
127. Ancestor of a vertex
128. Animal
129. Annihilator
130. Anti-gem
131. Antichain
132. Anticlique
133. Antidependence
134. Antidirected Hamiltonian cycle
135. Antidirected Hamiltonian path
136. Antidirected path
137. Antihole
138. Antimagic graph
139. Antiparallel arcs
140. Antiprism
141. Antisymmetric graph
142. Antisymmetric relation
143. Apex graph
144. Approximate point spectrum
145. Approximation algorithm
146. Arbitrarily hamiltonian graph
147. Arbitrarily traceable graph
148. Arbitrarily traverseable graph
149. Arbitrarily vertex decomposable graph
150. Arboreal hypergraph
151. Arborescence
152. Arboricity of a graph
153. Arc
154. Arc-forwarding index
155. Arc base
156. Argument
157. Arithmetic graph
158. Arrangeable alt
159. Arrangeable graph
160. Arrangement
161. Articulation point
162. Articulation set
163. Assignment problem
164. Associated Cayley digraph
165. Associated undirected graph
166. Associative search
167. Asteroidal number
168. Asteroidal set
169. Asteroidal triple
170. Asymmetric graph
171. Asymmetric relation
172. Atomic formula
173. Attachment graph
174. Attribute grammar
175. Attribute tree
176. Augmented adjacency matrix
177. Augmenting chain
178. Automata theory
179. Automorphism
180. Automorphism group
181. Automorphism problem
182. Average connectivity
183. Average domination number
184. Average independent domination number
185. B-Tree
186. B-Дерево
187. BB-Tree
188. BB-Дерево
189. Back-edge
190. Backbone
191. Backbone coloring
192. Backbone coloring number
193. Backward arc
194. Balance of a vertex
195. Balanced circuit
196. Balanced digraph
197. Balanced graph
198. Balanced hypergraph
199. Balanced signed graph
200. Ball number
201. Bandwidth
202. Bandwidth sum
203. Bar-visibility graph
204. Base digraph
205. Base of a directed graph
206. Base of a matroid
207. Based graph
208. Basic block
209. Basic cycle
210. Basic cycle set
211. Basic numberings
212. Basis number
213. Basis of a digraph
214. Batch systems
215. Bayesian network
216. Beraha number
217. Berge's Formula
218. Berge's complete graph
219. Berge's conjecture
220. Berge graph
221. Bi-Helly family
222. Biblock
223. Bicenter
224. Bicenter tree
225. Bicentre
226. Bicentroid of a tree
227. Bichordal bipartite graph
228. Bichromatic graph
229. Bichromatic hypergraph
230. Biclique
231. Biclique edge cover
232. Biclique edge covering number
233. Biclique number
234. Bicoloured subgraph
235. Bicomponent
236. Biconnected component
237. Biconvex bipartite graph
238. Bicritical graph
239. Bicubic graph
240. Bidirectional arcs
241. Bifurcant
242. Bigraph
243. Bihypergraph
244. Binary Hamming graph
245. Binary de Bruijn graph
246. Binary matroid
247. Binary n-dimensional cube
248. Binary relation
249. Binary search tree
250. Binary sorting tree