Тупиковые страницы

Следующие страницы не содержат ссылок на другие страницы в этой вики.

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

1. (Informationally) connected operands
2. (Informationally) incompatible operands
3. (Strong) equivalence of schemas
4. (X,Y)-Intersection graphs
5. (a,b)-Linear class of graphs
6. (a,b)-Panconnected graph
7. (a,b)-Planar graph
8. (a,b)-Separator
9. (a,b)-Vertex pancyclic graph
10. (a,d)-Edge-antimagic total graph
11. (a,d)-Edge-antimagic total labeling
12. (a,d)-Face antimagic graph
13. (g,f)-Factor
14. (g,f)-Factorization
15. (g,f)-Graph
16. (p,q)-Graceful signed graph
17. (r,s)-Regular graph
18. 1-Factor
19. 1-Factorization of K 2n
20. 1-Tree
21. 1-edge hamiltonian graph
22. 2-3-Tree
23. 2-Packing number
24. 2-Packing of a graph
25. 2-Pebbling property
26. 2-Section graph
27. 2-Switch
28. 3-set exact cover problem
29. 5-Flow conjecture
30. A-reprezentation of a cf-graph
31. AT-Free graph
32. Adjacent graphs
33. Arbitrarily traverseable graph
34. B-Tree
35. BB-Tree
36. Brute force'' method
37. CF-Language
38. CF-grammar
39. CS-Grammar
40. CS-language
41. Closed neighbourhood
42. Cluster
43. Cocomparability number
44. Cocycle
45. Common server
46. D-Decomposition
47. D-Dimensional c-ary array
48. D-Dimensional c-ary clique
49. D-Dimensional lattice
50. D-Regular tree with boundary
51. D-improper list chromatic number
52. DFS-tree
53. Dag of control flow graph
54. Data dependence
55. Data dependence graph
56. Data flow analysis frameworks
57. Data flow analysis problem
58. Data set
59. Data term
60. De Bruijn undirected graph
61. Decay number
62. Decidable problem
63. Decision problem
64. Decision problem DIMk
65. Decision tree
66. Decomposable graph
67. Decomposable hammock
68. Decomposable tournament
69. Decomposition
70. Decomposition dimension
71. Defect n-extendable graph
72. Deficiency
73. Deficiency of a bipartite graph
74. Deficiency of a graph
75. Defining set
76. Degenerate tree
77. Degree balanced digraph
78. Degree of a graph
79. Degree of a graph group
80. Degree of a hypergraph edge
81. Degree of an edge
82. Degree pair of a vertex
83. Degree sequence
84. Dense tree
85. Density
86. Dependent set of a matroid
87. Depth-first search (DFS)
88. Depth-first search tree
89. Depth-first spanning forest
90. Depth-first spanning tree
91. Depth of a DAG
92. Depth of a flow graph
93. Depth of a numbering
94. Depth of a tree
95. Depth of a vertex
96. Depth of an arrangeable graph
97. Depth of an arrangement
98. Derivation
99. Derivation tree
100. Derived sequence
101. Descendance graph
102. Descendant
103. Descendant of a vertex
104. Deterministic Turing machine
105. Deterministic automaton
106. Deterministic pushdown automaton
107. Detour
108. Detour center
109. Detour diameter
110. Detour distance
111. Detour dominating set
112. Detour eccentricity
113. Detour order
114. Detour periphery
115. Detour radius
116. Diagonal of a block
117. Diameter
118. Diamond
119. Difference digraph
120. Difference of graphs
121. Differential of a graph
122. Differential of a set
123. Dijkstra's algorithm
124. Dimension of a poset
125. Dinitz's algorithm
126. Direct product
127. Direct search
128. Directable graph
129. Directed acyclic graph
130. Directed edge
131. Directed forest
132. Directed hypergraph
133. Directed hyperpath
134. Directed hypertree
135. Directed multigraph
136. Directed sequence
137. Diregular digraph
138. Dirichlet eigenvalue problem
139. Disc
140. Disconnected graph
141. Discrete matroid
142. Disjunct union of graphs
143. Dismantlable graph
144. Dismantling enumeration
145. Dismantling order
146. Disorientation of an arc
147. Dissection
148. Distance
149. Distance-hereditary graph
150. Distance-transitive graph
151. Divider
152. Domatic number
153. Domatic partition
154. Domatically full graph
155. Dominance number
156. Dominant-covering graph
157. Dominant-matching graph
158. Dominant set
159. Dominating cycle
160. Dominating function
161. Dominating graph
162. Dominating path
163. Dominating set
164. Dominating vertex
165. Dominating walk
166. Domination graph
167. Domination graph (of a tournament)
168. Domination number
169. Domination number relative to v
170. Domination perfect graph
171. Domination subdivision number
172. Dominator
173. Dominator tree
174. Domino
175. Domsaturation number
176. Double competition number
177. Double dominating set
178. Double domination number
179. Double edge dominating set
180. Double edge domination number
181. Double ray
182. Double rotation
183. Double star
184. Doubly chordal graph
185. Doubly perfect ordering
186. Doubly regular tournament
187. Doubly simplicial vertex
188. Doubly stochastic matrix
189. Dual graph
190. Dual hypergraph
191. Dual hypertree
192. Dual map
193. Dual matroid
194. Dual tournament
195. Dually chordal graph
196. Dually compact closed class of graphs
197. Dudeney's round table problem
198. Dudeney set
199. E-Free grammar
200. E-Free сoncatenation closure
201. Eccentric graph
202. Eccentric sequence
203. Eccentricity of a vertex
204. Edge
205. Edge-cordial graph
206. Edge-cordial labeling
207. Edge-cover
208. Edge-critical graph
209. Edge-degree
210. Edge-forwarding index
211. Edge-graceful graph
212. Edge-graceful labeling
213. Edge-independent number
214. Edge-integrity
215. Edge-labeling
216. Edge-magic total graph
217. Edge-magic total labeling
218. Edge-ordering
219. Edge-pancyclic graph
220. Edge-pancyclicity
221. Edge-ranking of a graph
222. Edge-superconnectivity
223. Edge adding
224. Edge chromatic number
225. Edge clique cover
226. Edge clique cover number
227. Edge colourable graph
228. Edge connectivity
229. Edge connectivity number
230. Edge core
231. Edge covering
232. Edge critical graph
233. Edge cut, edge cut set
234. Edge density
235. Edge dominating set
236. Edge domination number
237. Edge graph
238. Edge group of a graph
239. Edge incidency matrix
240. Edge isomorphic graphs
241. Edge k-colourable graph
242. Edge k-colouring
243. Edge kernel
244. Edge list
245. Edge monochromatic class
246. Edge of a hypergraph
247. Edge of attachment
248. Edge reconstructibility
249. Edge regular graph
250. Edge space
251. Edge symmetric graph
252. Effectively solvable problem
253. Efficient dominating set
254. Eigenvalue of a graph
255. Element of a graph
256. Elementary Petri net
257. Elementary homomorphism
258. Embedding of a graph
259. Emptiness problem
260. Empty deadend
261. Empty deadlok
262. Empty graph
263. Empty hypergraph
264. Empty loop
265. Empty marking problem
266. Empty string
267. Empty subgraph
268. Empty symbol
269. Empty tree
270. Enabled transition
271. Enclosure transition
272. End-edge
273. Endblock
274. Endline graph
275. Endomorphism
276. Endpoint, end-vertex
277. Endpoints of a path (chain)
278. Energy of graph
279. Entire choice number
280. Entire chromatic number
281. Entire colouring
282. Entry node of a fragment
283. Entry vertex
284. Entry vertex of a subgraph
285. Environment of a vertex
286. Equally coloured vertices
287. Equiseparable trees
288. Equistable graph
289. Equitable partition
290. Equivalence of languages problem
291. Equivalence relation
292. Equivalent cycles
293. Equivalent derivations
294. Equivalent grammars
295. Equivalent program schemata
296. Equivalent programs
297. Erdos--Gallai criterion
298. Essential arc
299. Essential independent set
300. Euler graph
301. Eulerian chain
302. Eulerian circuit
303. Eulerian cycle
304. Eulerian digraph
305. Eulerian graph
306. Eulerian tour
307. Eulerian trail
308. Evaluated graph
309. Evaluation of a graph
310. Even component
311. Even contractile graph
312. Even graph
313. Even pair
314. Event
315. Event-condition system
316. Event condition
317. Event realization
318. Exact double dominating set
319. Exact n-step dominating set
320. Exact n-step domination graph
321. Exceptional graph
322. Exclusion operation
323. Execution of Petri net
324. Execution of large-block schema
325. Execution sequence
326. Exhaustive search
327. Exit
328. Exit node of a fragment
329. Exponent of a digraph
330. Expression dag
331. Extended odd graph
332. Extended regular expression
333. Exterior face
334. Exterior of a cycle
335. External input place
336. External output place
337. External place
338. External stability set
339. F-Direct arc
340. F-Dominating cycle
341. F-Inverse arc
342. F-Line
343. F-Matching width
344. F-Orthogonal subgraph
345. F-Path
346. F-Ray
347. F-Reachable (from p) node
348. F-Region
349. F-Stability number
350. F-Stable set
351. F-Width (of a hypergraph)
352. FAS-problem
353. FVS-problem
354. Face
355. Facet
356. Facial cycle
357. Factor-cf-graph
358. Factor-control-flow-graph
359. Factor-critical graph
360. Factor-graph
361. Factorization
362. Factorization of a graph
363. Feedback arc set
364. Feedback vertex set
365. Fibonacci heap
366. Fibre
367. Filter
368. Final substring
369. Finish vertex
370. Finishing node of fragment
371. Finite automaton
372. Finite graph
373. Finite tree
374. Finiteness problem
375. First Order formula
376. Five-color theorem
377. Fixed vertex
378. Flag
379. Flat forest
380. Flow
381. Flow-diagram
382. Flow-equivalent graphs
383. Flow augmenting path
384. Flow control
385. Flow dependence
386. Flower
387. Forbidden subgraph
388. Forcing number
389. Forcing set
390. Ford-Fulkerson's theorem
391. Forest-perfect graph
392. Forest graph
393. Formal language theory
394. Forward arc
395. Foundtion of G-trade
396. Fractional-chromatic number
397. Fractional-coloring
398. Fractional clique number
399. Fractional k-factor
400. Fractional matching
401. Fractional matching number
402. Fragment
403. Frame
404. Framing number
405. Fraternal orientation
406. Fraternally orientable digraph
407. Fraternally oriented digraph
408. Free-choice Petri net
409. Free Petri net
410. Free language
411. Free tree
412. Frequency-ordered binary search tree
413. Fully disconnected graph
414. Functional directed graph
415. Functional vertex
416. Functionally equivalent program schemata
417. Functionally equivalent programs
418. Fundamental circuit
419. Fundamental cutset matrix
420. Fundamental cycle matrix
421. Fundamental set of circuits
422. Fundamental set of cutsets
423. G-Matching function
424. G-Trade
425. G-Vertex regular graph
426. Game-chromatic number
427. Game domination number
428. Gamma-Finite graph
429. Gamma-Restricted graph
430. Gamma^-1-Finite graph
431. Gamma t(G)-Excellent graph
432. Gem
433. General graph
434. General phrase-structure grammar
435. Generalized Kautz digraph
436. Generalized Petersen graph
437. Generalized binary split tree
438. Generalized competition graph
439. Generalized de Bruijn graph
440. Generalized interval order
441. Generalized semiorder
442. Generating function
443. Genus of a graph
444. Geodesically convex set of vertices
445. Geodetic chain
446. Geodetic graph
447. Geometric dual graph
448. Geometric realization of graph
449. Girth
450. Global density
451. Global forcing number
452. Global forcing set
453. Global irregularity of a digraph
454. Global strong alliance number
455. Global w-density
456. Gossip graph
457. Gossiping problem
458. Graceful graph
459. Graft
460. Grammar of type 0
461. Grammar rule
462. Graph, undirected graph, nonoriented graph
463. Graph Clustering Problem
464. Graph Minor Theorem
465. Graph automorphism group
466. Graph bundle
467. Graph capacity
468. Graph circuit space
469. Graph cutset space
470. Graph enumeration
471. Graph grammar
472. Graph labeling
473. Graph morphism
474. Graph of a partial order
475. Graph of a strict partial order
476. Graph of finite automata
477. Graph of function
478. Graph of reachable markings
479. Graph representation
480. Graph rewriting system (with priorities)
481. Graph spectral theory
482. Graph symmetry number
483. Graph transformation rule
484. Graph union
485. Graph with boundary
486. Graphic sequence of numbers
487. Graphical (graphic) matroid
488. Graphical partition of a number
489. Graphical sequence of numbers
490. Graphical trade
491. Graphoid
492. Graphs union
493. Greedy algorithm
494. Grid graph
495. Group graph
496. Group of a directed graph
497. Growing tree
498. Grundy colouring
499. Grundy number
500. Gupta scheme