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

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

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

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