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

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

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

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

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

  1. "Brute force" method
  2. (Abstract) syntax representation
  3. (Informationally) connected operands
  4. (Informationally) incompatible operands
  5. (L,Y)-Bunch
  6. (L,Y)-Связка
  7. (Strong) equivalence of schemas
  8. (X,Y)-Intersection graphs
  9. (X,Y)-Графы пересечений
  10. (a,b)-Cut
  11. (a,b)-Linear class of graphs
  12. (a,b)-Panconnected graph
  13. (a,b)-Planar graph
  14. (a,b)-Separator
  15. (a,b)-Vertex pancyclic graph
  16. (a,b)-Плоский граф
  17. (a,d)-Edge-antimagic total graph
  18. (a,d)-Edge-antimagic total labeling
  19. (a,d)-Face antimagic graph
  20. (g,f)-Factor
  21. (g,f)-Factorization
  22. (g,f)-Graph
  23. (k,d)-Arithmetic graph
  24. (k,d)-Arithmetic numbering
  25. (k,d)-Coloring
  26. (k,d)-Раскраска
  27. (k,g)-Cage
  28. (p,q)-Graceful signed graph
  29. (r,s)-Regular graph
  30. (t,i,j)-Cover
  31. (Абстрактное) синтаксическое дерево
  32. (Абстрактное) синтаксическое представление
  33. 0-Chain of a graph
  34. 0-Цепь графа
  35. 1-2-Братское дерево
  36. 1-2 Brother tree
  37. 1-Base
  38. 1-Chain of a graph
  39. 1-Chordal graph
  40. 1-Factor
  41. 1-Factorization of K 2n
  42. 1-Tree
  43. 1-edge hamiltonian graph
  44. 1-База
  45. 1-Дерево
  46. 1-Цепь графа
  47. 2-3-Tree
  48. 2-3-Дерево
  49. 2-3 Brother tree
  50. 2-Connected graph
  51. 2-Packing number
  52. 2-Packing of a graph
  53. 2-Pebbling property
  54. 2-Section graph
  55. 2-Switch
  56. 2-Секционный граф
  57. 3-Combination problem
  58. 3-set exact cover problem
  59. 3-Раскрашиваемость
  60. 5-Flow conjecture
  61. A-reprezentation of a cf-graph
  62. A-граф
  63. A-представление уграфа
  64. ANC-Грамматика
  65. AT-Free graph
  66. AVL-Tree
  67. Abdiff-tolerance competition graph
  68. Absolute hypergraph
  69. Absolute incenter
  70. Absolute inner radius
  71. Absolute median
  72. Absolute of a rooted tree
  73. Absolute outcenter
  74. Absolute outer radius
  75. Absolute retract
  76. Absorbant set
  77. Absorbent set
  78. Abstract computer
  79. Abstract graph
  80. Abstract machine
  81. Abstract syntax tree
  82. Acceptable assignment
  83. Access term
  84. Achromatic number
  85. Achromatic status
  86. Ackermann's function
  87. Acyclic chromatic number
  88. Acyclic colouring
  89. Acyclic dominating set
  90. Acyclic domination number
  91. Acyclic graph
  92. Acyclic orientation
  93. Additive hereditary graph property
  94. Addressable transformation graph
  95. Addressing scheme
  96. Adjacency
  97. Adjacency list
  98. Adjacency matrix
  99. Adjacency operator
  100. Adjacency property
  101. Adjacent arcs
  102. Adjacent edges
  103. Adjacent faces
  104. Adjacent forest graph
  105. Adjacent graphs
  106. Adjacent vertices
  107. Adjoint digraph
  108. Admissible sequence
  109. Advancing arc
  110. Algebraic connectivity
  111. Algebraic graph theory
  112. Algorithm
  113. Alive Petri net
  114. Almost 3-regular
  115. Almost cubic graph
  116. Alpha-Acyclic hypergraph
  117. Alpha-Approximable problem
  118. Alpha-Cyclic hypergraph
  119. Alphabet
  120. Alt
  121. Alternating chain
  122. Amalgam
  123. Amalgamation of a graph
  124. Amallamorphic graphs
  125. Amount of a flow
  126. Anarboricity of a graph
  127. Ancestor of a vertex
  128. Animal
  129. Annihilator
  130. Anti-gem
  131. Antichain
  132. Anticlique
  133. Antidependence
  134. Antidirected Hamiltonian cycle
  135. Antidirected Hamiltonian path
  136. Antidirected path
  137. Antihole
  138. Antimagic graph
  139. Antiparallel arcs
  140. Antiprism
  141. Antisymmetric graph
  142. Antisymmetric relation
  143. Apex graph
  144. Approximate point spectrum
  145. Approximation algorithm
  146. Arbitrarily hamiltonian graph
  147. Arbitrarily traceable graph
  148. Arbitrarily traverseable graph
  149. Arbitrarily vertex decomposable graph
  150. Arboreal hypergraph
  151. Arborescence
  152. Arboricity of a graph
  153. Arc
  154. Arc-forwarding index
  155. Arc base
  156. Argument
  157. Arithmetic graph
  158. Arrangeable alt
  159. Arrangeable graph
  160. Arrangement
  161. Articulation point
  162. Articulation set
  163. Assignment problem
  164. Associated Cayley digraph
  165. Associated undirected graph
  166. Associative search
  167. Asteroidal number
  168. Asteroidal set
  169. Asteroidal triple
  170. Asymmetric graph
  171. Asymmetric relation
  172. Atomic formula
  173. Attachment graph
  174. Attribute grammar
  175. Attribute tree
  176. Augmented adjacency matrix
  177. Augmenting chain
  178. Automata theory
  179. Automorphism
  180. Automorphism group
  181. Automorphism problem
  182. Average connectivity
  183. Average domination number
  184. Average independent domination number
  185. B-Tree
  186. B-Дерево
  187. BB-Tree
  188. BB-Дерево
  189. Back-edge
  190. Backbone
  191. Backbone coloring
  192. Backbone coloring number
  193. Backward arc
  194. Balance of a vertex
  195. Balanced circuit
  196. Balanced digraph
  197. Balanced graph
  198. Balanced hypergraph
  199. Balanced signed graph
  200. Ball number
  201. Bandwidth
  202. Bandwidth sum
  203. Bar-visibility graph
  204. Base digraph
  205. Base of a directed graph
  206. Base of a matroid
  207. Based graph
  208. Basic block
  209. Basic cycle
  210. Basic cycle set
  211. Basic numberings
  212. Basis number
  213. Basis of a digraph
  214. Batch systems
  215. Bayesian network
  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-Chvatal 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. Centralized systems
  326. Centroid
  327. Centroid sequence
  328. Centroid vertex
  329. Centroidal vertex
  330. Cf-Graph
  331. Chain
  332. Chain graph
  333. Characteristic number of a graph
  334. Characteristic polynomial of Laplacian
  335. Characteristic polynomial of a graph
  336. Chinese postman's problem
  337. Choice number
  338. Chomsky hierarchy
  339. Chomsky normal form
  340. Choosability
  341. Chord
  342. Chordal bipartite graph
  343. Chordal graph
  344. Chordless cycle
  345. Chromatic decomposition of a graph
  346. Chromatic distance
  347. Chromatic function
  348. Chromatic index
  349. Chromatic number
  350. Chromatic polynomial
  351. Chromatic status
  352. Chromatically equivalent graphs
  353. Chromatically unique graph
  354. Church's thesis
  355. Circuit
  356. Circuit closed graph
  357. Circuit edge connected vertices
  358. Circuit isomorphic graphs
  359. Circuit of matroid
  360. Circuit rank
  361. Circuitless graph
  362. Circulant graph
  363. Circular-arc graph
  364. Circular chromatic number
  365. Circular clique number
  366. Circular coloring of a graph
  367. Circular perfect graph
  368. Circumference of a graph
  369. Circumstance
  370. Circumstance problem
  371. Classification of Binary Trees
  372. Classification of large graphs
  373. Claw
  374. Claw-free graph
  375. Clique
  376. Clique-good graph
  377. Clique-independence number
  378. Clique-independent set
  379. Clique-partition
  380. Clique-perfect graph
  381. Clique-transversal
  382. Clique-transversal number
  383. Clique-width
  384. Clique convergent
  385. Clique cover
  386. Clique cover number, clique-covering number
  387. Clique divergent
  388. Clique graph
  389. Clique matrix
  390. Clique model
  391. Clique number
  392. Clique polynomial
  393. Clique problem
  394. Clique separator
  395. Clique size
  396. Clique tree
  397. Closed hamiltonian neighbourhood
  398. Closed neighbourhood
  399. Closed semiring
  400. Closed walk
  401. Closure of graph
  402. Cluster
  403. Clustered graph
  404. Clutter
  405. Coadjoint graphs
  406. Coadjoint pair
  407. Coalescing of two rooted graphs
  408. Coarseness
  409. Cobase of a matroid
  410. Coboundary of a graph
  411. Coboundary operator
  412. Cochromatic number
  413. Cocircuit of a graph
  414. Cocircuit of a matroid
  415. Cocomparability graph
  416. Cocomparability number
  417. Cocomparability ordering
  418. Cocycle
  419. Cocycle basis
  420. Cocycle vector
  421. Cocyclic matrix
  422. Cocyclic rank of a graph
  423. Code of a tree
  424. Codependent set of a matroid
  425. Codiameter
  426. Codistance
  427. Cograph
  428. Cographic matroid
  429. Coindependent set of a matroid
  430. Collapsible graph
  431. Color graph of a group
  432. Color requirement of a vertex
  433. Coloration
  434. Colored distance
  435. Colored graph
  436. Colored multigraph
  437. Coloring, colouring
  438. Coloring number
  439. Coloured Petri net
  440. Coloured class
  441. Combinatorial Laplacian
  442. Combinatorial dual graph, combinatorically dual graph
  443. Comet
  444. Common ancestor
  445. Common minimal dominating graph
  446. Common receiver
  447. Common server
  448. Compact
  449. Compact closed class of graphs
  450. Comparability graph
  451. Comparable vertices
  452. Competition-common enemy graph
  453. Competition graph (of a tournament)
  454. Competition number
  455. Compilation problem
  456. Complement-reducible graph
  457. Complement of a graph, complementary graph
  458. Complete bipartite graph
  459. Complete coloring
  460. Complete colouring
  461. Complete directed graph
  462. Complete graph
  463. Complete homomorphism of order n
  464. Complete k-partite graph
  465. Complete k-uniform hypergraph
  466. Complete multipartite graph
  467. Complete product
  468. Complete rotation
  469. Complete set of graph invariants
  470. Complete system of equivalent transformations
  471. Complete tree
  472. Completed Husimi tree
  473. Completely triangular graph
  474. Complex windmill
  475. Complexity of RAM
  476. Complexity theory
  477. Component design method
  478. Component index
  479. Component number
  480. Component of a graph
  481. Composite hammock
  482. Composition of graphs
  483. Compound dependency graph
  484. Compound graph
  485. Computation
  486. Concatenation
  487. Concatenation closure
  488. Concepts Path Graph
  489. Conceptual graph
  490. Condensation
  491. Conditional connectivity
  492. Cone over a graph
  493. Conflict
  494. Confluent NCE graph grammar
  495. Conformal hypergraph
  496. Conjunction of graphs
  497. Connected component
  498. Connected component of a hypergraph
  499. Connected dominating set
  500. Connected domination number

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

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