Страницы без интервики-ссылок

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

Следующие страницы не имеют интервики-ссылок:

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

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

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

Источник — http://pco.iis.nsk.su/wega/index.php/Служебная:Без_интервики