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

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

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

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

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

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

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