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

Материал из WikiGrapp
Перейти к:навигация, поиск

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

Просмотреть (предыдущие 500 | следующие 500) (20 | 50 | 100 | 250 | 500)

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

Просмотреть (предыдущие 500 | следующие 500) (20 | 50 | 100 | 250 | 500)