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

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

51. 2-Packing of a graph
52. 2-Pebbling property
53. 2-Section graph
54. 2-Switch
55. 2-Секционный граф
56. 3-Combination problem
57. 3-set exact cover problem
58. 3-Раскрашиваемость
59. 5-Flow conjecture
60. A-reprezentation of a cf-graph
61. A-граф
62. A-представление уграфа
63. ANC-Грамматика
64. AT-Free graph
65. AVL-Tree
66. Abdiff-tolerance competition graph
67. Absolute hypergraph
68. Absolute incenter
69. Absolute inner radius
70. Absolute median
71. Absolute of a rooted tree
72. Absolute outcenter
73. Absolute outer radius
74. Absolute retract
75. Absorbant set
76. Absorbent set
77. Abstract computer
78. Abstract graph
79. Abstract machine
80. Abstract syntax tree
81. Acceptable assignment
82. Access term
83. Achromatic number
84. Achromatic status
85. Ackermann's function
86. Acyclic chromatic number
87. Acyclic colouring
88. Acyclic dominating set
89. Acyclic domination number
90. Acyclic graph
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-Cyclic hypergraph
117. Alphabet
118. Alt
119. Alternating chain
120. Amalgam
121. Amalgamation of a graph
122. Amallamorphic graphs
123. Amount of a flow
124. Anarboricity of a graph
125. Ancestor of a vertex
126. Animal
127. Annihilator
128. Anti-gem
129. Antichain
130. Anticlique
131. Antidependence
132. Antidirected Hamiltonian cycle
133. Antidirected Hamiltonian path
134. Antidirected path
135. Antihole
136. Antimagic graph
137. Antiparallel arcs
138. Antiprism
139. Antisymmetric graph
140. Antisymmetric relation
141. Apex graph
142. Approximable problem
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
153. Arc-forwarding index
154. Arc base
155. Argument
156. Arithmetic graph
157. Arrangeable alt
158. Arrangeable graph
159. Arrangement
160. Articulation point
161. Articulation set
162. Assignment problem
163. Associated Cayley digraph
164. Associated undirected graph
165. Associative search
166. Asteroidal number
167. Asteroidal set
168. Asteroidal triple
169. Asymmetric graph
170. Asymmetric relation
171. Atomic formula
172. Attachment graph
173. Attribute grammar
174. Attribute tree
175. Augmented adjacency matrix
176. Augmenting chain
177. Automata theory
178. Automorphism
179. Automorphism group
180. Automorphism problem
181. Average connectivity
182. Average domination number
183. Average independent domination number
184. B-Tree
185. B-Дерево
186. B-дерево (дерево многоканального поиска)
187. B-деревья без явного задания параметров кэша
188. BB-Tree
189. BB-Дерево
190. Back-edge
191. Backbone
192. Backbone coloring
193. Backbone coloring number
194. Backward arc
195. Balance of a vertex
196. Balanced circuit
197. Balanced digraph
198. Balanced graph
199. Balanced hypergraph
200. Balanced signed graph
201. Ball number
202. Bandwidth
203. Bandwidth sum
204. Bar-visibility graph
205. Base digraph
206. Base of a directed graph
207. Base of a matroid
208. Based graph
209. Basic block
210. Basic cycle
211. Basic cycle set
212. Basic numberings
213. Basis number
214. Basis of a digraph
215. Batch systems
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
251. Binary split tree
252. Binary tree
253. Binary vertex
254. Binode
255. Binomial tree
256. Bipanpositionable graph
257. Bipartite bihypergraph
258. Bipartite density
259. Bipartite graph
260. Bipartite matroid
261. Bipartite permutation graph
262. Bipartite tolerance graph
263. Bipyramid
264. Bisection width of a graph
265. Bisimplicial edge
266. Bistochastic matrix
267. Block
268. Block-cutvertex tree, block-cutpoint graph
269. Block duplicate graph
270. Block graph
271. Block of a graph
272. Bondy--Chvtal closure operation
273. Boundary NCE graph grammar
274. Boundary node of a fragment
275. Boundary of a 2-mesh
276. Boundary of a face
277. Boundary operator
278. Bounded Petri net
279. Bounded reachability matrix
280. Bounded reaching matrix
281. Bounded tolerance graph
282. Boundedness problem
283. Branch-weight centroid number
284. Branch of a tree relative to a vertex v
285. Breadth first search
286. Bridge
287. Bridged graph
288. Bridgeless graph
289. Broadcast digraph
290. Broadcast graph
291. Broadcasting problem
292. Brooks graph
293. Brother of a vertex
294. Brother tree
295. Brute force'' method
296. Bull
297. Butterfly graph
298. C-Chordal graph
299. CF-Language
300. CF-grammar