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

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

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