Страницы без интервики-ссылок

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

101. Adjacent arcs
102. Adjacent edges
103. Adjacent faces
104. Adjacent forest graph
105. Adjacent graphs
106. Adjacent vertices
107. Adjoint digraph
108. Admissible sequence
109. Advancing arc
110. Algebraic connectivity
111. Algebraic graph theory
112. Algorithm
113. Alive Petri net
114. Almost 3-regular
115. Almost cubic graph
116. Alpha-Acyclic hypergraph
117. Alpha-Approximable problem
118. Alpha-Cyclic hypergraph
119. Alphabet
120. Alt
121. Alternating chain
122. Amalgam
123. Amalgamation of a graph
124. Amallamorphic graphs
125. Amount of a flow
126. Anarboricity of a graph
127. Ancestor of a vertex
128. Animal
129. Annihilator
130. Anti-gem
131. Antichain
132. Anticlique
133. Antidependence
134. Antidirected Hamiltonian cycle
135. Antidirected Hamiltonian path
136. Antidirected path
137. Antihole
138. Antimagic graph
139. Antiparallel arcs
140. Antiprism
141. Antisymmetric graph
142. Antisymmetric relation
143. Apex graph
144. Approximate point spectrum
145. Approximation algorithm
146. Arbitrarily hamiltonian graph
147. Arbitrarily traceable graph
148. Arbitrarily traverseable graph
149. Arbitrarily vertex decomposable graph
150. Arboreal hypergraph
151. Arborescence
152. Arboricity of a graph
153. Arc
154. Arc-forwarding index
155. Arc base
156. Argument
157. Arithmetic graph
158. Arrangeable alt
159. Arrangeable graph
160. Arrangement
161. Articulation point
162. Articulation set
163. Assignment problem
164. Associated Cayley digraph
165. Associated undirected graph
166. Associative search
167. Asteroidal number
168. Asteroidal set
169. Asteroidal triple
170. Asymmetric graph
171. Asymmetric relation
172. Atomic formula
173. Attachment graph
174. Attribute grammar
175. Attribute tree
176. Augmented adjacency matrix
177. Augmenting chain
178. Automata theory
179. Automorphism
180. Automorphism group
181. Automorphism problem
182. Average connectivity
183. Average domination number
184. Average independent domination number
185. B-Tree
186. B-Дерево
187. BB-Tree
188. BB-Дерево
189. Back-edge
190. Backbone
191. Backbone coloring
192. Backbone coloring number
193. Backward arc
194. Balance of a vertex
195. Balanced circuit
196. Balanced digraph
197. Balanced graph
198. Balanced hypergraph
199. Balanced signed graph
200. Ball number
201. Bandwidth
202. Bandwidth sum
203. Bar-visibility graph
204. Base digraph
205. Base of a directed graph
206. Base of a matroid
207. Based graph
208. Basic block
209. Basic cycle
210. Basic cycle set
211. Basic numberings
212. Basis number
213. Basis of a digraph
214. Batch systems
215. Bayesian network
216. Beraha number
217. Berge's Formula
218. Berge's complete graph
219. Berge's conjecture
220. Berge graph
221. Bi-Helly family
222. Biblock
223. Bicenter
224. Bicenter tree
225. Bicentre
226. Bicentroid of a tree
227. Bichordal bipartite graph
228. Bichromatic graph
229. Bichromatic hypergraph
230. Biclique
231. Biclique edge cover
232. Biclique edge covering number
233. Biclique number
234. Bicoloured subgraph
235. Bicomponent
236. Biconnected component
237. Biconvex bipartite graph
238. Bicritical graph
239. Bicubic graph
240. Bidirectional arcs
241. Bifurcant
242. Bigraph
243. Bihypergraph
244. Binary Hamming graph
245. Binary de Bruijn graph
246. Binary matroid
247. Binary n-dimensional cube
248. Binary relation
249. Binary search tree
250. Binary sorting tree
251. Binary split tree
252. Binary tree
253. Binary vertex
254. Binode
255. Binomial tree
256. Bipanpositionable graph
257. Bipartite bihypergraph
258. Bipartite density
259. Bipartite graph
260. Bipartite matroid
261. Bipartite permutation graph
262. Bipartite tolerance graph
263. Bipyramid
264. Bisection width of a graph
265. Bisimplicial edge
266. Bistochastic matrix
267. Block
268. Block-cutvertex tree, block-cutpoint graph
269. Block duplicate graph
270. Block graph
271. Block of a graph
272. Bondy-Chvatal closure operation
273. Boundary NCE graph grammar
274. Boundary node of a fragment
275. Boundary of a 2-mesh
276. Boundary of a face
277. Boundary operator
278. Bounded Petri net
279. Bounded reachability matrix
280. Bounded reaching matrix
281. Bounded tolerance graph
282. Boundedness problem
283. Branch-weight centroid number
284. Branch of a tree relative to a vertex v
285. Breadth first search
286. Bridge
287. Bridged graph
288. Bridgeless graph
289. Broadcast digraph
290. Broadcast graph
291. Broadcasting problem
292. Brooks graph
293. Brother of a vertex
294. Brother tree
295. Brute force'' method
296. Bull
297. Butterfly graph
298. C-Chordal graph
299. CF-Language
300. CF-grammar
301. CKI-орграф
302. CPM
303. CS-Grammar
304. CS-language
305. Cactus
306. Cage number
307. Call graph
308. Capacity of a cut-set
309. Capacity of an arc
310. Cardinal product
311. Cardinality constrained circuit problem
312. Cartesian product of graphs
313. Cartesian sum of graphs
314. Case term
315. Categorical product of graphs
316. Caterpillar
317. Caterpillar-pure graph
318. Cayley graph
319. Center
320. Center of gravity of a graph
321. Center vertex
322. Central distance
323. Central fringe
324. Central vertex
325. Centralized systems
326. Centroid
327. Centroid sequence
328. Centroid vertex
329. Centroidal vertex
330. Cf-Graph
331. Chain
332. Chain graph
333. Characteristic number of a graph
334. Characteristic polynomial of Laplacian
335. Characteristic polynomial of a graph
336. Chinese postman's problem
337. Choice number
338. Chomsky hierarchy
339. Chomsky normal form
340. Choosability
341. Chord
342. Chordal bipartite graph
343. Chordal graph
344. Chordless cycle
345. Chromatic decomposition of a graph
346. Chromatic distance
347. Chromatic function
348. Chromatic index
349. Chromatic number
350. Chromatic polynomial
351. Chromatic status
352. Chromatically equivalent graphs
353. Chromatically unique graph
354. Church's thesis
355. Circuit
356. Circuit closed graph
357. Circuit edge connected vertices
358. Circuit isomorphic graphs
359. Circuit of matroid
360. Circuit rank
361. Circuitless graph
362. Circulant graph
363. Circular-arc graph
364. Circular chromatic number
365. Circular clique number
366. Circular coloring of a graph
367. Circular perfect graph
368. Circumference of a graph
369. Circumstance
370. Circumstance problem
371. Classification of Binary Trees
372. Classification of large graphs
373. Claw
374. Claw-free graph
375. Clique
376. Clique-good graph
377. Clique-independence number
378. Clique-independent set
379. Clique-partition
380. Clique-perfect graph
381. Clique-transversal
382. Clique-transversal number
383. Clique-width
384. Clique convergent
385. Clique cover
386. Clique cover number, clique-covering number
387. Clique divergent
388. Clique graph
389. Clique matrix
390. Clique model
391. Clique number
392. Clique polynomial
393. Clique problem
394. Clique separator
395. Clique size
396. Clique tree
397. Closed hamiltonian neighbourhood
398. Closed neighbourhood
399. Closed semiring
400. Closed walk
401. Closure of graph
402. Cluster
403. Clustered graph
404. Clutter
405. Coadjoint graphs
406. Coadjoint pair
407. Coalescing of two rooted graphs
408. Coarseness
409. Cobase of a matroid
410. Coboundary of a graph
411. Coboundary operator
412. Cochromatic number
413. Cocircuit of a graph
414. Cocircuit of a matroid
415. Cocomparability graph
416. Cocomparability number
417. Cocomparability ordering
418. Cocycle
419. Cocycle basis
420. Cocycle vector
421. Cocyclic matrix
422. Cocyclic rank of a graph
423. Code of a tree
424. Codependent set of a matroid
425. Codiameter
426. Codistance
427. Cograph
428. Cographic matroid
429. Coindependent set of a matroid
430. Collapsible graph
431. Color graph of a group
432. Color requirement of a vertex
433. Coloration
434. Colored distance
435. Colored graph
436. Colored multigraph
437. Coloring, colouring
438. Coloring number
439. Coloured Petri net
440. Coloured class
441. Combinatorial Laplacian
442. Combinatorial dual graph, combinatorically dual graph
443. Comet
444. Common ancestor
445. Common minimal dominating graph
446. Common receiver
447. Common server
448. Compact
449. Compact closed class of graphs
450. Comparability graph
451. Comparable vertices
452. Competition-common enemy graph
453. Competition graph (of a tournament)
454. Competition number
455. Compilation problem
456. Complement-reducible graph
457. Complement of a graph, complementary graph
458. Complete bipartite graph
459. Complete coloring
460. Complete colouring
461. Complete directed graph
462. Complete graph
463. Complete homomorphism of order n
464. Complete k-partite graph
465. Complete k-uniform hypergraph
466. Complete multipartite graph
467. Complete product
468. Complete rotation
469. Complete set of graph invariants
470. Complete system of equivalent transformations
471. Complete tree
472. Completed Husimi tree
473. Completely triangular graph
474. Complex windmill
475. Complexity of RAM
476. Complexity theory
477. Component design method
478. Component index
479. Component number
480. Component of a graph
481. Composite hammock
482. Composition of graphs
483. Compound dependency graph
484. Compound graph
485. Computation
486. Concatenation
487. Concatenation closure
488. Concepts Path Graph
489. Conceptual graph
490. Condensation
491. Conditional connectivity
492. Cone over a graph
493. Conflict
494. Confluent NCE graph grammar
495. Conformal hypergraph
496. Conjunction of graphs
497. Connected component
498. Connected component of a hypergraph
499. Connected dominating set
500. Connected domination number
501. Connected graph
502. Connected hierarchical graph
503. Connected hypergraph
504. Connected set of vertices
505. Connected to relation
506. Connected vertices
507. Connective index
508. Connectivity
509. Connectivity axioms
510. Connectivity function
511. Connectivity matrix
512. Consecutive adjacent graph
513. Consecutive labeling
514. Constructible graph
515. Constructing enumeration
516. Constructing order
517. Containment graph
518. Context-free grammar
519. Context-free language
520. Context-sensitive grammar
521. Context-sensitive language
522. Contrabasis
523. Contractable edge
524. Contracted visibility graph
525. Contracting edge, contraction of an edge
526. Contraction of a graph
527. Contraction of an even pair
528. Contrafunctional graph
529. Control dependence
530. Control flow graph
531. Converse digraph
532. Convex bipartite graph
533. Convex dominating set
534. Convex domination number
535. Convex linear graph
536. Convex set in G
537. Coordinated graph
538. Corank function of a matroid
539. Core
540. Corona
541. Cospectral graphs
542. Cotree, co-tree
543. Countable graph
544. Counter automation
545. Coverability tree
546. Covering cycle
547. Covering graph
548. Covering set of vertices
549. Covering vertex set
550. Critical edge
551. Critical graph
552. Critical kernel-imperfect digraph
553. Critical pair
554. Critical path
555. Critical path method
556. Critical set
557. Critical tournament
558. Critical vertex
559. Criticality index
560. Critically k-connected graph
561. Cross
562. Cross-adjacent edges
563. Cross-chromatic index
564. Cross-free coloring
565. Cross-free matching
566. Cross-free matching number
567. Cross arc
568. Cross product
569. Crossing number
570. Crown
571. Crown of graphs
572. Cubic graph
573. Cubical graph
574. Cut-edge
575. Cut-vertex
576. Cut of a layout
577. Cutpoint
578. Cutpoint graph
579. Cutset
580. Cutset matrix
581. Cutset matroid
582. Cutting set
583. Cutting vertex
584. Cutvertex
585. Cutwidth of a graph
586. Cutwidth of a layout
587. Cyclability
588. Cycle
589. Cycle-factor
590. Cycle basis
591. Cycle complementary
592. Cycle cover problem
593. Cycle embedding matrix
594. Cycle isomorphism
595. Cycle matrix
596. Cycle matroid
597. Cycle space
598. Cycle spectrum
599. Cycle vector
600. Cyclic alternating chain