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

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

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

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

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

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

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

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