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

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

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

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

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

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

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