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

Материал из WikiGrapp
Перейти к:навигация, поиск

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

Просмотреть (предыдущие 500 | следующие 500) (20 | 50 | 100 | 250 | 500)

  1. Connectivity axioms
  2. Connectivity function
  3. Connectivity matrix
  4. Consecutive adjacent graph
  5. Consecutive labeling
  6. Constructible graph
  7. Constructing enumeration
  8. Constructing order
  9. Containment graph
  10. Context-free grammar
  11. Context-free language
  12. Context-sensitive grammar
  13. Context-sensitive language
  14. Contrabasis
  15. Contractable edge
  16. Contracted visibility graph
  17. Contracting edge, contraction of an edge
  18. Contraction of a graph
  19. Contraction of an even pair
  20. Contrafunctional graph
  21. Control dependence
  22. Converse digraph
  23. Convex bipartite graph
  24. Convex dominating set
  25. Convex domination number
  26. Convex linear graph
  27. Convex set in G
  28. Coordinated graph
  29. Corank function of a matroid
  30. Core
  31. Corona
  32. Cospectral graphs
  33. Cotree, co-tree
  34. Countable graph
  35. Counter automation
  36. Coverability tree
  37. Covering cycle
  38. Covering graph
  39. Covering set of vertices
  40. Covering vertex set
  41. Critical edge
  42. Critical graph
  43. Critical kernel-imperfect digraph
  44. Critical pair
  45. Critical path
  46. Critical path method
  47. Critical set
  48. Critical tournament
  49. Critical vertex
  50. Criticality index
  51. Critically k-connected graph
  52. Cross
  53. Cross-adjacent edges
  54. Cross-chromatic index
  55. Cross-free coloring
  56. Cross-free matching
  57. Cross-free matching number
  58. Cross arc
  59. Cross product
  60. Crossing number
  61. Crown
  62. Crown of graphs
  63. Cubic graph
  64. Cubical graph
  65. Cut-edge
  66. Cut-vertex
  67. Cut of a layout
  68. Cutpoint
  69. Cutpoint graph
  70. Cutset
  71. Cutset matrix
  72. Cutset matroid
  73. Cutting set
  74. Cutting vertex
  75. Cutvertex
  76. Cutwidth of a graph
  77. Cutwidth of a layout
  78. Cyclability
  79. Cycle
  80. Cycle-factor
  81. Cycle basis
  82. Cycle complementary
  83. Cycle cover problem
  84. Cycle embedding matrix
  85. Cycle isomorphism
  86. Cycle matrix
  87. Cycle matroid
  88. Cycle space
  89. Cycle spectrum
  90. Cycle vector
  91. Cyclic alternating chain
  92. Cyclic chromatic number
  93. Cyclic edge
  94. Cyclic edge connected vertices
  95. Cyclic graph
  96. Cyclic matroid
  97. Cyclic sequence
  98. Cyclic vector of a graph
  99. Cyclomatic complexity of a program
  100. Cyclomatic matrix
  101. Cyclomatic number
  102. D-Decomposition
  103. D-Dimensional c-ary array
  104. D-Dimensional c-ary clique
  105. D-Dimensional lattice
  106. D-Regular tree with boundary
  107. D-improper list chromatic number
  108. DAG (Directed Acyclic Graph)
  109. DFS
  110. DFS-tree
  111. Dag for basic block
  112. Dag of control flow graph
  113. Data dependence
  114. Data dependence graph
  115. Data flow analysis frameworks
  116. Data flow analysis problem
  117. Data set
  118. Data term
  119. De Bruijn graph
  120. De Bruijn undirected graph
  121. Decay number
  122. Decidable problem
  123. Decision problem
  124. Decision problem DIMk
  125. Decision tree
  126. Decomposable graph
  127. Decomposable hammock
  128. Decomposable tournament
  129. Decomposition
  130. Decomposition dimension
  131. Defect n-extendable graph
  132. Deficiency
  133. Deficiency of a bipartite graph
  134. Deficiency of a graph
  135. Defining set
  136. Degenerate tree
  137. Degree balanced digraph
  138. Degree of a graph
  139. Degree of a graph group
  140. Degree of a hypergraph edge
  141. Degree of an edge
  142. Degree pair of a vertex
  143. Degree sequence
  144. Dense tree
  145. Density
  146. Dependent set of a matroid
  147. Depth-first search (DFS)
  148. Depth-first search tree
  149. Depth-first spanning forest
  150. Depth-first spanning tree
  151. Depth of a DAG
  152. Depth of a numbering
  153. Depth of a tree
  154. Depth of a vertex
  155. Depth of an arrangeable graph
  156. Depth of an arrangement
  157. Derivation
  158. Derivation tree
  159. Derived sequence
  160. Descendance graph
  161. Descendant
  162. Descendant of a vertex
  163. Descendent of a vertex
  164. Deterministic Turing machine
  165. Deterministic automaton
  166. Deterministic pushdown automaton
  167. Detour
  168. Detour center
  169. Detour diameter
  170. Detour distance
  171. Detour dominating set
  172. Detour eccentricity
  173. Detour order
  174. Detour periphery
  175. Detour radius
  176. Diagonal of a block
  177. Diameter
  178. Diametral chain
  179. Diamond
  180. Difference digraph
  181. Difference of graphs
  182. Differential of a graph
  183. Differential of a set
  184. Digraph
  185. Dijkstra's algorithm
  186. Dimension of a poset
  187. Dinitz's algorithm
  188. Direct product
  189. Direct search
  190. Directable graph
  191. Directed acyclic graph
  192. Directed edge
  193. Directed forest
  194. Directed graph
  195. Directed hypergraph
  196. Directed hyperpath
  197. Directed hypertree
  198. Directed multigraph
  199. Directed sequence
  200. Diregular digraph
  201. Dirichlet eigenvalue problem
  202. Disc
  203. Disconnected graph
  204. Discrete matroid
  205. Disjunct union of graphs
  206. Dismantlable graph
  207. Dismantling enumeration
  208. Dismantling order
  209. Disorientation of an arc
  210. Dissection
  211. Distance
  212. Distance-hereditary graph
  213. Distance-transitive graph
  214. Distance between two vertices
  215. Divider
  216. Domatic number
  217. Domatic partition
  218. Domatically full graph
  219. Dominance number
  220. Dominant-covering graph
  221. Dominant-matching graph
  222. Dominant set
  223. Dominating cycle
  224. Dominating function
  225. Dominating graph
  226. Dominating path
  227. Dominating set
  228. Dominating vertex
  229. Dominating walk
  230. Domination graph
  231. Domination graph (of a tournament)
  232. Domination number
  233. Domination number relative to v
  234. Domination perfect graph
  235. Domination subdivision number
  236. Dominator
  237. Dominator tree
  238. Domino
  239. Domsaturation number
  240. Double competition number
  241. Double dominating set
  242. Double domination number
  243. Double edge dominating set
  244. Double edge domination number
  245. Double ray
  246. Double rotation
  247. Double star
  248. Doubly chordal graph
  249. Doubly perfect ordering
  250. Doubly regular tournament
  251. Doubly simplicial vertex
  252. Doubly stochastic matrix
  253. Dual graph
  254. Dual hypergraph
  255. Dual hypertree
  256. Dual map
  257. Dual matroid
  258. Dual tournament
  259. Dually chordal graph
  260. Dually compact closed class of graphs
  261. Dudeney's round table problem
  262. Dudeney set
  263. E-Free grammar
  264. E-Free сoncatenation closure
  265. E-Правило
  266. E k-Cordial graph
  267. Eccentric graph
  268. Eccentric sequence
  269. Eccentricity of a vertex
  270. Economy region
  271. Edge
  272. Edge-cordial graph
  273. Edge-cordial labeling
  274. Edge-cover
  275. Edge-critical graph
  276. Edge-degree
  277. Edge-forwarding index
  278. Edge-graceful graph
  279. Edge-graceful labeling
  280. Edge-independent number
  281. Edge-integrity
  282. Edge-isoperimetric problem
  283. Edge-labeling
  284. Edge-magic total graph
  285. Edge-magic total labeling
  286. Edge-ordering
  287. Edge-pancyclic graph
  288. Edge-pancyclicity
  289. Edge-ranking of a graph
  290. Edge-superconnectivity
  291. Edge adding
  292. Edge chromatic number
  293. Edge clique cover
  294. Edge clique cover number
  295. Edge colourable graph
  296. Edge connectivity
  297. Edge connectivity number
  298. Edge core
  299. Edge covering
  300. Edge critical graph
  301. Edge cut, edge cut set
  302. Edge density
  303. Edge dominating set
  304. Edge domination number
  305. Edge graph
  306. Edge group of a graph
  307. Edge incidency matrix
  308. Edge isomorphic graphs
  309. Edge k-colourable graph
  310. Edge k-colouring
  311. Edge kernel
  312. Edge list
  313. Edge monochromatic class
  314. Edge of a hypergraph
  315. Edge of attachment
  316. Edge path cover
  317. Edge path number
  318. Edge ranking number
  319. Edge reconstructibility
  320. Edge regular graph
  321. Edge space
  322. Edge symmetric graph
  323. Edge t-ranking
  324. Effectively solvable problem
  325. Efficient dominating set
  326. Eigenvalue of a graph
  327. Element of a graph
  328. Elementary Petri net
  329. Elementary homomorphism
  330. Embedding of a graph
  331. Emptiness problem
  332. Empty deadend
  333. Empty deadlok
  334. Empty graph
  335. Empty hypergraph
  336. Empty loop
  337. Empty marking problem
  338. Empty problem
  339. Empty string
  340. Empty subgraph
  341. Empty symbol
  342. Empty tree
  343. Enabled transition
  344. Enclosure transition
  345. End-edge
  346. Endblock
  347. Endline graph
  348. Endomorphism
  349. Endpoint, end-vertex
  350. Endpoints of a path (chain)
  351. Energy of graph
  352. Entire choice number
  353. Entire chromatic number
  354. Entire colouring
  355. Entry
  356. Entry node of a fragment
  357. Entry vertex
  358. Entry vertex of a subgraph
  359. Environment of a vertex
  360. Equally coloured vertices
  361. Equiseparable trees
  362. Equistable graph
  363. Equitable partition
  364. Equivalence of languages problem
  365. Equivalence problem
  366. Equivalence relation
  367. Equivalent cycles
  368. Equivalent derivations
  369. Equivalent grammars
  370. Equivalent program schemata
  371. Equivalent programs
  372. Erdos--Gallai criterion
  373. Essential arc
  374. Essential independent set
  375. Euler's formula
  376. Euler graph
  377. Eulerian chain
  378. Eulerian circuit
  379. Eulerian cycle
  380. Eulerian digraph
  381. Eulerian graph
  382. Eulerian tour
  383. Eulerian trail
  384. Evaluated graph
  385. Evaluation of a graph
  386. Even component
  387. Even contractile graph
  388. Even graph
  389. Even pair
  390. Event
  391. Event-condition system
  392. Event condition
  393. Event realization
  394. Exact double dominating set
  395. Exact n-step dominating set
  396. Exact n-step domination graph
  397. Exceptional graph
  398. Exclusion operation
  399. Execution of Petri net
  400. Execution of large-block schema
  401. Execution sequence
  402. Exhaustive search
  403. Exit
  404. Exit node of a fragment
  405. Exponent of a digraph
  406. Expression DAG
  407. Expression dag
  408. Extended odd graph
  409. Extended regular expression
  410. Exterior face
  411. Exterior of a cycle
  412. External input place
  413. External output place
  414. External place
  415. External stability set
  416. F-Arc
  417. F-Direct arc
  418. F-Dominating cycle
  419. F-Factor
  420. F-Heap
  421. F-Inverse arc
  422. F-Line
  423. F-Matching width
  424. F-Orthogonal subgraph
  425. F-Path
  426. F-Rank
  427. F-Ray
  428. F-Reachable (from p) node
  429. F-Region
  430. F-Stability number
  431. F-Stable set
  432. F-Width (of a hypergraph)
  433. F-Достижимость
  434. F-Дуга
  435. F-Линия
  436. F-Луч
  437. F-Область
  438. F-Прямая дуга
  439. F-Путь
  440. F-Ранг
  441. F-Фактор
  442. FAS-problem
  443. FVS-problem
  444. Face
  445. Facet
  446. Facial cycle
  447. Factor-cf-graph
  448. Factor-critical graph
  449. Factor-graph
  450. Factorization
  451. Factorization of a graph
  452. Father of a vertex
  453. Feedback arc set
  454. Feedback vertex set
  455. Fibonacci heap
  456. Fibre
  457. Filter
  458. Final substring
  459. Finish vertex
  460. Finishing node of fragment
  461. Finite automaton
  462. Finite graph
  463. Finite tree
  464. Finiteness problem
  465. First Order formula
  466. Five-color theorem
  467. Fixed vertex
  468. Flag
  469. Flat forest
  470. Flow
  471. Flow-diagram
  472. Flow-equivalent graphs
  473. Flow augmenting path
  474. Flow control
  475. Flow dependence
  476. Flower
  477. Forbidden subgraph
  478. Forcing number
  479. Forcing set
  480. Ford-Fulkerson's theorem
  481. Forest-perfect graph
  482. Forest graph
  483. Formal language
  484. Formal language theory
  485. Forward arc
  486. Foundtion of G-trade
  487. Fractional-chromatic number
  488. Fractional-coloring
  489. Fractional clique number
  490. Fractional k-factor
  491. Fractional matching
  492. Fractional matching number
  493. Fragment
  494. Frame
  495. Framing number
  496. Fraternal orientation
  497. Fraternally orientable digraph
  498. Fraternally oriented digraph
  499. Free-choice Petri net
  500. Free Petri net

Просмотреть (предыдущие 500 | следующие 500) (20 | 50 | 100 | 250 | 500)