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

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

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

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

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

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

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