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

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

1. (Abstract) syntax representation
2. (Informationally) connected operands
3. (Informationally) incompatible operands
4. (L,Y)-Bunch
5. (L,Y)-Связка
6. (Strong) equivalence of schemas
7. (X,Y)-Intersection graphs
8. (X,Y)-Графы пересечений
9. (a,b)-Cut
10. (a,b)-Linear class of graphs
11. (a,b)-Panconnected graph
12. (a,b)-Planar graph
13. (a,b)-Separator
14. (a,b)-Vertex pancyclic graph
15. (a,b)-Плоский граф
16. (a,d)-Edge-antimagic total graph
17. (a,d)-Edge-antimagic total labeling
18. (a,d)-Face antimagic graph
19. (g,f)-Factor
20. (g,f)-Factorization
21. (g,f)-Graph
22. (k,d)-Arithmetic graph
23. (k,d)-Arithmetic numbering
24. (k,d)-Coloring
25. (k,d)-Раскраска
26. (k,g)-Cage
27. (p,q)-Graceful signed graph
28. (r,s)-Regular graph
29. (t,i,j)-Cover
30. (Абстрактное) синтаксическое дерево
31. (Абстрактное) синтаксическое представление
32. 0-Chain of a graph
33. 0-Цепь графа
34. 1-2-Братское дерево
35. 1-2 Brother tree
36. 1-Base
37. 1-Chain of a graph
38. 1-Chordal graph
39. 1-Factor
40. 1-Factorization of K 2n
41. 1-Tree
42. 1-edge hamiltonian graph
43. 1-База
44. 1-Дерево
45. 1-Цепь графа
46. 2-3-Tree
47. 2-3-Дерево
48. 2-3 Brother tree
49. 2-Connected graph
50. 2-Packing number
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 orientation
91. Additive hereditary graph property
92. Addressable transformation graph
93. Addressing scheme
94. Adjacency
95. Adjacency list
96. Adjacency matrix
97. Adjacency operator
98. Adjacency property
99. Adjacent arcs
100. Adjacent edges
101. Adjacent faces
102. Adjacent forest graph
103. Adjacent graphs
104. Adjacent vertices
105. Adjoint digraph
106. Admissible sequence
107. Advancing arc
108. Algebraic connectivity
109. Algebraic graph theory
110. Algorithm
111. Alive Petri net
112. Almost 3-regular
113. Almost cubic graph
114. Alpha-Acyclic hypergraph
115. Alpha-Cyclic hypergraph
116. Alphabet
117. Alt
118. Alternating chain
119. Amalgam
120. Amalgamation of a graph
121. Amallamorphic graphs
122. Amount of a flow
123. Anarboricity of a graph
124. Ancestor of a vertex
125. Animal
126. Annihilator
127. Anti-gem
128. Antichain
129. Anticlique
130. Antidependence
131. Antidirected Hamiltonian cycle
132. Antidirected Hamiltonian path
133. Antidirected path
134. Antihole
135. Antimagic graph
136. Antiparallel arcs
137. Antiprism
138. Antisymmetric graph
139. Antisymmetric relation
140. Apex graph
141. Approximable problem
142. Approximate point spectrum
143. Approximation algorithm
144. Arbitrarily hamiltonian graph
145. Arbitrarily traceable graph
146. Arbitrarily traverseable graph
147. Arbitrarily vertex decomposable graph
148. Arboreal hypergraph
149. Arborescence
150. Arboricity of a graph
151. Arc-forwarding index
152. Arc base
153. Argument
154. Arithmetic graph
155. Arrangeable alt
156. Arrangement
157. Articulation point
158. Articulation set
159. Assignment problem
160. Associated Cayley digraph
161. Associated undirected graph
162. Associative search
163. Asteroidal number
164. Asteroidal set
165. Asteroidal triple
166. Asymmetric graph
167. Asymmetric relation
168. Atomic formula
169. Attachment graph
170. Attribute grammar
171. Attribute tree
172. Augmented adjacency matrix
173. Augmenting chain
174. Automata theory
175. Automorphism
176. Automorphism group
177. Automorphism problem
178. Average connectivity
179. Average domination number
180. Average independent domination number
181. B-Tree
182. B-Дерево
183. B-дерево (дерево многоканального поиска)
184. B-деревья без явного задания параметров кэша
185. BB-Tree
186. BB-Дерево
187. Back-edge
188. Backbone
189. Backbone coloring
190. Backbone coloring number
191. Backward arc
192. Balance of a vertex
193. Balanced circuit
194. Balanced digraph
195. Balanced graph
196. Balanced hypergraph
197. Balanced signed graph
198. Ball number
199. Bandwidth
200. Bandwidth sum
201. Bar-visibility graph
202. Base digraph
203. Base of a directed graph
204. Base of a matroid
205. Based graph
206. Basic block
207. Basic cycle
208. Basic cycle set
209. Basic numberings
210. Basis number
211. Basis of a digraph
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
251. Binomial tree
252. Bipanpositionable graph
253. Bipartite bihypergraph
254. Bipartite density
255. Bipartite graph
256. Bipartite matroid
257. Bipartite permutation graph
258. Bipartite tolerance graph
259. Bipyramid
260. Bisection width of a graph
261. Bisimplicial edge
262. Bistochastic matrix
263. Block
264. Block-cutvertex tree, block-cutpoint graph
265. Block duplicate graph
266. Block of a graph
267. Bondy--Chvtal closure operation
268. Boundary NCE graph grammar
269. Boundary node of a fragment
270. Boundary of a 2-mesh
271. Boundary of a face
272. Boundary operator
273. Bounded Petri net
274. Bounded reachability matrix
275. Bounded reaching matrix
276. Bounded tolerance graph
277. Boundedness problem
278. Branch-weight centroid number
279. Branch of a tree relative to a vertex v
280. Breadth first search
281. Bridge
282. Bridged graph
283. Bridgeless graph
284. Broadcast digraph
285. Broadcast graph
286. Broadcasting problem
287. Brooks graph
288. Brother of a vertex
289. Brother tree
290. Brute force'' method
291. Bull
292. Butterfly graph
293. C-Chordal graph
294. CF-Language
295. CF-grammar
296. CKI-орграф
297. CPM
298. CS-Grammar
299. CS-language
300. Cactus
301. Cage number
302. Call graph
303. Capacity of a cut-set
304. Capacity of an arc
305. Cardinal product
306. Cardinality constrained circuit problem
307. Cartesian product of graphs
308. Cartesian sum of graphs
309. Case term
310. Categorical product of graphs
311. Caterpillar
312. Caterpillar-pure graph
313. Cayley graph
314. Center
315. Center of gravity of a graph
316. Center vertex
317. Central distance
318. Central fringe
319. Central vertex
320. Centroid
321. Centroid sequence
322. Centroid vertex
323. Centroidal vertex
324. Cf-Graph
325. Chain
326. Chain graph
327. Characteristic number of a graph
328. Characteristic polynomial of Laplacian
329. Characteristic polynomial of a graph
330. Chinese postman's problem
331. Choice number
332. Chomsky hierarchy
333. Chomsky normal form
334. Choosability
335. Chord
336. Chordal bipartite graph
337. Chordal graph
338. Chordless cycle
339. Chromatic decomposition of a graph
340. Chromatic distance
341. Chromatic function
342. Chromatic index
343. Chromatic number
344. Chromatic polynomial
345. Chromatic status
346. Chromatically equivalent graphs
347. Chromatically unique graph
348. Church's thesis
349. Circuit
350. Circuit closed graph
351. Circuit edge connected vertices
352. Circuit isomorphic graphs
353. Circuit of matroid
354. Circuit rank
355. Circuitless graph
356. Circulant graph
357. Circular-arc graph
358. Circular chromatic number
359. Circular clique number
360. Circular coloring of a graph
361. Circular perfect graph
362. Circumference of a graph
363. Circumstance
364. Circumstance problem
365. Classification of Binary Trees
366. Claw
367. Claw-free graph
368. Clique
369. Clique-good graph
370. Clique-independence number
371. Clique-independent set
372. Clique-partition
373. Clique-perfect graph
374. Clique-transversal
375. Clique-transversal number
376. Clique-width
377. Clique convergent
378. Clique cover
379. Clique cover number, clique-covering number
380. Clique divergent
381. Clique graph
382. Clique matrix
383. Clique model
384. Clique number
385. Clique polynomial
386. Clique problem
387. Clique separator
388. Clique size
389. Clique tree
390. Closed hamiltonian neighbourhood
391. Closed neighbourhood
392. Closed semiring
393. Closed walk
394. Closure of graph
395. Cluster
396. Clustered graph
397. Clutter
398. Coadjoint graphs
399. Coadjoint pair
400. Coalescing of two rooted graphs
401. Coarseness
402. Cobase of a matroid
403. Coboundary of a graph
404. Coboundary operator
405. Cochromatic number
406. Cocircuit of a graph
407. Cocircuit of a matroid
408. Cocomparability graph
409. Cocomparability number
410. Cocomparability ordering
411. Cocycle
412. Cocycle basis
413. Cocycle vector
414. Cocyclic matrix
415. Cocyclic rank of a graph
416. Code of a tree
417. Codependent set of a matroid
418. Codiameter
419. Codistance
420. Cograph
421. Cographic matroid
422. Coindependent set of a matroid
423. Color graph of a group
424. Color requirement of a vertex
425. Coloration
426. Colored distance
427. Colored graph
428. Colored multigraph
429. Coloring, colouring
430. Coloring number
431. Coloured Petri net
432. Coloured class
433. Combinatorial Laplacian
434. Combinatorial dual graph, combinatorically dual graph
435. Comet
436. Common ancestor
437. Common minimal dominating graph
438. Common receiver
439. Common server
440. Compact
441. Compact closed class of graphs
442. Comparability graph
443. Comparable vertices
444. Competition-common enemy graph
445. Competition graph (of a tournament)
446. Competition number
447. Compilation problem
448. Complement-reducible graph
449. Complement of a graph, complementary graph
450. Complete bipartite graph
451. Complete coloring
452. Complete colouring
453. Complete directed graph
454. Complete graph
455. Complete homomorphism of order n
456. Complete k-partite graph
457. Complete k-uniform hypergraph
458. Complete multipartite graph
459. Complete product
460. Complete rotation
461. Complete set of graph invariants
462. Complete system of equivalent transformations
463. Complete tree
464. Completed Husimi tree
465. Completely triangular graph
466. Complex windmill
467. Complexity of RAM
468. Complexity theory
469. Component design method
470. Component index
471. Component number
472. Component of a graph
473. Composite hammock
474. Composition of graphs
475. Compound dependency graph
476. Compound graph
477. Computation
478. Concatenation
479. Concatenation closure
480. Concepts Path Graph
481. Conceptual graph
482. Condensation
483. Conditional connectivity
484. Cone over a graph
485. Conflict
486. Confluent NCE graph grammar
487. Conformal hypergraph
488. Conjunction of graphs
489. Connected component
490. Connected component of a hypergraph
491. Connected dominating set
492. Connected domination number
493. Connected graph
494. Connected hierarchical graph
495. Connected hypergraph
496. Connected set of vertices
497. Connected to relation
498. Connected vertices
499. Connective index
500. Connectivity