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

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

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

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

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