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

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

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

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

  1. Binomial tree
  2. Bipanpositionable graph
  3. Bipartite bihypergraph
  4. Bipartite density
  5. Bipartite graph
  6. Bipartite matroid
  7. Bipartite permutation graph
  8. Bipartite tolerance graph
  9. Bipyramid
  10. Bisection width of a graph
  11. Bisimplicial edge
  12. Bistochastic matrix
  13. Block
  14. Block-cutvertex tree, block-cutpoint graph
  15. Block duplicate graph
  16. Block of a graph
  17. Bondy-Chvatal closure operation
  18. Boundary NCE graph grammar
  19. Boundary node of a fragment
  20. Boundary of a 2-mesh
  21. Boundary of a face
  22. Boundary operator
  23. Bounded Petri net
  24. Bounded reachability matrix
  25. Bounded reaching matrix
  26. Bounded tolerance graph
  27. Boundedness problem
  28. Branch-weight centroid number
  29. Branch of a tree relative to a vertex v
  30. Breadth first search
  31. Bridge
  32. Bridged graph
  33. Bridgeless graph
  34. Broadcast digraph
  35. Broadcast graph
  36. Broadcasting problem
  37. Brooks graph
  38. Brother of a vertex
  39. Brother tree
  40. Brute force'' method
  41. Bull
  42. Butterfly graph
  43. C-Chordal graph
  44. CF-Language
  45. CF-grammar
  46. CKI-орграф
  47. CPM
  48. CS-Grammar
  49. CS-language
  50. Cactus
  51. Cage number
  52. Call graph
  53. Capacity of a cut-set
  54. Capacity of an arc
  55. Cardinal product
  56. Cardinality constrained circuit problem
  57. Cartesian product of graphs
  58. Cartesian sum of graphs
  59. Case term
  60. Categorical product of graphs
  61. Caterpillar
  62. Caterpillar-pure graph
  63. Cayley graph
  64. Center
  65. Center of gravity of a graph
  66. Center vertex
  67. Central distance
  68. Central fringe
  69. Central vertex
  70. Centroid
  71. Centroid sequence
  72. Centroid vertex
  73. Centroidal vertex
  74. Cf-Graph
  75. Chain
  76. Chain graph
  77. Characteristic number of a graph
  78. Characteristic polynomial of Laplacian
  79. Characteristic polynomial of a graph
  80. Chinese postman's problem
  81. Choice number
  82. Chomsky hierarchy
  83. Chomsky normal form
  84. Choosability
  85. Chord
  86. Chordal bipartite graph
  87. Chordal graph
  88. Chordless cycle
  89. Chromatic decomposition of a graph
  90. Chromatic distance
  91. Chromatic function
  92. Chromatic index
  93. Chromatic number
  94. Chromatic polynomial
  95. Chromatic status
  96. Chromatically equivalent graphs
  97. Chromatically unique graph
  98. Church's thesis
  99. Circuit
  100. Circuit closed graph
  101. Circuit edge connected vertices
  102. Circuit isomorphic graphs
  103. Circuit of matroid
  104. Circuit rank
  105. Circuitless graph
  106. Circulant graph
  107. Circular-arc graph
  108. Circular chromatic number
  109. Circular clique number
  110. Circular coloring of a graph
  111. Circular perfect graph
  112. Circumference of a graph
  113. Circumstance
  114. Circumstance problem
  115. Classification of Binary Trees
  116. Claw
  117. Claw-free graph
  118. Clique
  119. Clique-good graph
  120. Clique-independence number
  121. Clique-independent set
  122. Clique-partition
  123. Clique-perfect graph
  124. Clique-transversal
  125. Clique-transversal number
  126. Clique-width
  127. Clique convergent
  128. Clique cover
  129. Clique cover number, clique-covering number
  130. Clique divergent
  131. Clique graph
  132. Clique matrix
  133. Clique model
  134. Clique number
  135. Clique polynomial
  136. Clique problem
  137. Clique separator
  138. Clique size
  139. Clique tree
  140. Closed hamiltonian neighbourhood
  141. Closed neighbourhood
  142. Closed semiring
  143. Closed walk
  144. Closure of graph
  145. Cluster
  146. Clustered graph
  147. Clutter
  148. Coadjoint graphs
  149. Coadjoint pair
  150. Coalescing of two rooted graphs
  151. Coarseness
  152. Cobase of a matroid
  153. Coboundary of a graph
  154. Coboundary operator
  155. Cochromatic number
  156. Cocircuit of a graph
  157. Cocircuit of a matroid
  158. Cocomparability graph
  159. Cocomparability number
  160. Cocomparability ordering
  161. Cocycle
  162. Cocycle basis
  163. Cocycle vector
  164. Cocyclic matrix
  165. Cocyclic rank of a graph
  166. Code of a tree
  167. Codependent set of a matroid
  168. Codiameter
  169. Codistance
  170. Cograph
  171. Cographic matroid
  172. Coindependent set of a matroid
  173. Color graph of a group
  174. Color requirement of a vertex
  175. Coloration
  176. Colored distance
  177. Colored graph
  178. Colored multigraph
  179. Coloring, colouring
  180. Coloring number
  181. Coloured Petri net
  182. Coloured class
  183. Combinatorial Laplacian
  184. Combinatorial dual graph, combinatorically dual graph
  185. Comet
  186. Common ancestor
  187. Common minimal dominating graph
  188. Common receiver
  189. Common server
  190. Compact
  191. Compact closed class of graphs
  192. Comparability graph
  193. Comparable vertices
  194. Competition-common enemy graph
  195. Competition graph (of a tournament)
  196. Competition number
  197. Compilation problem
  198. Complement-reducible graph
  199. Complement of a graph, complementary graph
  200. Complete bipartite graph
  201. Complete coloring
  202. Complete colouring
  203. Complete directed graph
  204. Complete graph
  205. Complete homomorphism of order n
  206. Complete k-partite graph
  207. Complete k-uniform hypergraph
  208. Complete multipartite graph
  209. Complete product
  210. Complete rotation
  211. Complete set of graph invariants
  212. Complete system of equivalent transformations
  213. Complete tree
  214. Completed Husimi tree
  215. Completely triangular graph
  216. Complex windmill
  217. Complexity of RAM
  218. Complexity theory
  219. Component design method
  220. Component index
  221. Component number
  222. Component of a graph
  223. Composite hammock
  224. Composition of graphs
  225. Compound dependency graph
  226. Compound graph
  227. Computation
  228. Concatenation
  229. Concatenation closure
  230. Concepts Path Graph
  231. Conceptual graph
  232. Condensation
  233. Conditional connectivity
  234. Cone over a graph
  235. Conflict
  236. Confluent NCE graph grammar
  237. Conformal hypergraph
  238. Conjunction of graphs
  239. Connected component
  240. Connected component of a hypergraph
  241. Connected dominating set
  242. Connected domination number
  243. Connected graph
  244. Connected hierarchical graph
  245. Connected hypergraph
  246. Connected set of vertices
  247. Connected to relation
  248. Connected vertices
  249. Connective index
  250. Connectivity

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

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