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

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

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

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

  1. Line group of a graph
  2. Line incident with a vertex
  3. Linear-bounded automation
  4. Linear NCE graph grammar
  5. Linear arrangement
  6. Linear bounded automaton
  7. Linear component
  8. Linear extension of a poset
  9. Linear forest
  10. Linear hypergraph
  11. Linear k-arboricity of a graph
  12. Linear k-forest
  13. Linear layout
  14. Linear layout of a tree
  15. Linear matroid
  16. Linear order
  17. Linear scheme (code, presentation)
  18. Linear subgraph of a directed graph
  19. Linear subgraph of a graph
  20. Linear tree
  21. Linear vertex arboricity
  22. Liouville property of an operator on graphs
  23. List assignment
  24. List chromatic number
  25. List coloring
  26. List edge-coloring problem
  27. List edge chromatic number
  28. List homomorphism
  29. List total coloring
  30. List total coloring problem
  31. List vertex-coloring problem
  32. Live transition
  33. Liveness problem
  34. Local-edge-connectivity
  35. Local computation on graphs
  36. Local exponent of digraph
  37. Local independence number
  38. Local input place
  39. Local irregularity of a digraph
  40. Local isomorphism
  41. Local output place
  42. Local place
  43. Local replacement method
  44. Local tree-width
  45. Locally countable graph
  46. Locally finite graph
  47. Locally k-connected graph
  48. Locally longest with respect to M cycle
  49. Locally restricted graph
  50. Locally semicomplete digraph
  51. Locating-dominating set
  52. Locating set
  53. Location-domination number
  54. Location number
  55. Logic for expressing graph properties
  56. Loop
  57. Loop of matroid
  58. Loop region
  59. Lower independence number
  60. M-Ary tree
  61. M-Choosable graph with impropriety d
  62. M-Convex set in G
  63. M-Convexity number
  64. M-Numbering
  65. M-Нумерация
  66. MAXIMUM FLOW problem
  67. MAXIMUM INDEPENDENT SET problem
  68. MIDS problem
  69. MINIMUM FILL-IN problem
  70. MINIMUM GRAPH COLORING problem
  71. MINIMUM VERTEX COVER problem
  72. Magic labeling
  73. Magnet in a graph
  74. Magnitude of a flow
  75. Main eigenvalue
  76. Majority dominating function
  77. Majority domination number
  78. Map
  79. Mark
  80. Marked graph
  81. Marked trap
  82. Marker
  83. Marking
  84. Marking operation
  85. Marriage problem
  86. Martynyuk schemata
  87. Matching
  88. Matching equivalent
  89. Matching number
  90. Matching polynomial
  91. Matching width
  92. Matrix-tree theorem
  93. Matrix graph
  94. Matrix matroid
  95. Matroid
  96. Matroid cocycle space
  97. Matroid connectivity
  98. Matroid cycle space
  99. Matthews graph
  100. Max-flow min-cut theorem
  101. Maxclique
  102. Maximal complete subgraph
  103. Maximal dominating set
  104. Maximal domination number
  105. Maximal exclusion graph
  106. Maximal flow
  107. Maximal independence number
  108. Maximal packing
  109. Maximal singular graph
  110. Maximal strongly singular graph
  111. Maximal subnet
  112. Maximal tree
  113. Maximally irregular graph
  114. Maximum-cardinality matching
  115. Maximum edge-connected graph
  116. Maximum hyperflow problem
  117. Maximum matching graph
  118. Maximum neighbour
  119. Maximum neighbourhood ordering
  120. Maximum point-connected graph
  121. McGee graph
  122. Mean diameter
  123. Median generalized binary split tree
  124. Median graph
  125. Median split tree
  126. Membership problem
  127. Memory state
  128. Menger's theorem
  129. Mergeable heap
  130. Metric-locating-dominating set
  131. Metric-location-domination number
  132. Metric dimension
  133. Middle graph
  134. Minimal connected graph
  135. Minimal dominating graph
  136. Minimal flow
  137. Minimal imperfect graph
  138. Minimal irredundance imperfect graph
  139. Minimal separator
  140. Minimal triangulation
  141. Minimum broadcast graph
  142. Minimum cost hyperflow problem
  143. Minimum gossip graph
  144. Minimum independent dominating set problem
  145. Minimum separator
  146. Minimum t-spanner problem
  147. Minor-closed class of graphs
  148. Minor of a graph
  149. Minsky machine
  150. Minus dominating function
  151. Minus domination number
  152. Mixed graph
  153. Mode
  154. Mode vertex
  155. Model of computation
  156. Module of a graph
  157. Monadic Second Order formula
  158. Monge graph
  159. Monochromatic class (set)
  160. Monotone transitive graph
  161. Monotonicity property
  162. Mu-Excellent graph
  163. Multi-coloring
  164. Multicrown
  165. Multidimensional B-tree
  166. Multidimensional search tree
  167. Multientry zone
  168. Multigraph
  169. Multigraph of strength s
  170. Multiple arcs
  171. Multiple domination
  172. Multiple edges
  173. Multiplicity
  174. Multiplicity of a covering
  175. Multiplicity of an edge
  176. Multiway tree
  177. Mutual matchings
  178. Mutually connected vertices
  179. Mutually eccentric vertices
  180. Mutually graceful trees
  181. N-Chromatic number
  182. N-Cube graph
  183. N-Dimensional hypercube
  184. N-Dominating set
  185. N-Domination number
  186. N-Extendable graph
  187. N-Factorization of a graph
  188. N-Folded Petersen graph
  189. N-Independence number
  190. N-Independent set
  191. N-Iterated line graph
  192. N-Numbering
  193. N-Star graph
  194. N-Unavoidable graph
  195. N-mesh
  196. N-node
  197. N-Звездный граф
  198. N-Нумерация
  199. N-Расширяемый граф
  200. N-Складной граф Петерсена
  201. N-Фактор графа
  202. N-Факторизация
  203. N-Факторизуемый граф
  204. N-Хроматическое число
  205. NCE graph grammar
  206. NP-Complete language
  207. NP-Complete problem
  208. NP-Hard language
  209. NP-Hard problem
  210. NP-complete problem
  211. NP-Полная задача
  212. NP-Трудная задача
  213. Naked vertex
  214. Near perfect matching
  215. Nearest common ancestor
  216. Nearest common dominator
  217. Nearly regular graph
  218. Neighbour transition
  219. Neighbourhood matrix
  220. Neighbourhood of a vertex
  221. Neighbourhood tree
  222. Neighbouring vertices
  223. Nested set of alts
  224. Nested set of zones
  225. Net
  226. Net formula
  227. Network
  228. Node
  229. Node bisector
  230. Node listing
  231. Non-circular grammar
  232. Non-edge
  233. Non-interpreted schemata
  234. Non-separable graph
  235. Noncovered vertex
  236. Nondecidable problem
  237. Nondeterministic Turing machine
  238. Nondeterministic finite automaton
  239. Nondeterministic pushdown automaton
  240. Nonstrong argument
  241. Nonstrong input
  242. Nonstrong output
  243. Nonstrong result
  244. Nonterminal alphabet
  245. Nonterminal symbol
  246. Normal approximate (point) spectrum
  247. Normally symmetric graph
  248. Normed weighted graph
  249. Nowhere-zero k-flow
  250. Null graph

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

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