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

Перейти к навигации Перейти к поиску

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

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

Просмотреть ( | ) (20 | 50 | 100 | 250 | 500)

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

Просмотреть ( | ) (20 | 50 | 100 | 250 | 500)

Источник — http://pco.iis.nsk.su/grapp/index.php/Служебная:Тупиковые_страницы