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

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

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
501. Connectivity axioms
502. Connectivity function
503. Connectivity matrix
504. Consecutive adjacent graph
505. Consecutive labeling
506. Constructible graph
507. Constructing enumeration
508. Constructing order
509. Containment graph
510. Context-free grammar
511. Context-free language
512. Context-sensitive grammar
513. Context-sensitive language
514. Contrabasis
515. Contractable edge
516. Contracted visibility graph
517. Contracting edge, contraction of an edge
518. Contraction of a graph
519. Contraction of an even pair
520. Contrafunctional graph
521. Control dependence
522. Converse digraph
523. Convex bipartite graph
524. Convex dominating set
525. Convex domination number
526. Convex linear graph
527. Convex set in G
528. Coordinated graph
529. Corank function of a matroid
530. Core
531. Corona
532. Cospectral graphs
533. Cotree, co-tree
534. Countable graph
535. Counter automation
536. Coverability tree
537. Covering cycle
538. Covering graph
539. Covering set of vertices
540. Covering vertex set
541. Critical edge
542. Critical graph
543. Critical kernel-imperfect digraph
544. Critical pair
545. Critical path
546. Critical path method
547. Critical set
548. Critical tournament
549. Critical vertex
550. Criticality index
551. Critically k-connected graph
552. Cross
553. Cross-adjacent edges
554. Cross-chromatic index
555. Cross-free coloring
556. Cross-free matching
557. Cross-free matching number
558. Cross arc
559. Cross product
560. Crossing number
561. Crown
562. Crown of graphs
563. Cubic graph
564. Cubical graph
565. Cut-edge
566. Cut-vertex
567. Cut of a layout
568. Cutpoint
569. Cutpoint graph
570. Cutset
571. Cutset matrix
572. Cutset matroid
573. Cutting set
574. Cutting vertex
575. Cutvertex
576. Cutwidth of a graph
577. Cutwidth of a layout
578. Cyclability
579. Cycle
580. Cycle-factor
581. Cycle basis
582. Cycle complementary
583. Cycle cover problem
584. Cycle embedding matrix
585. Cycle isomorphism
586. Cycle matrix
587. Cycle matroid
588. Cycle space
589. Cycle spectrum
590. Cycle vector
591. Cyclic alternating chain
592. Cyclic chromatic number
593. Cyclic edge
594. Cyclic edge connected vertices
595. Cyclic graph
596. Cyclic matroid
597. Cyclic sequence
598. Cyclic vector of a graph
599. Cyclomatic complexity of a program
600. Cyclomatic matrix
601. Cyclomatic number
602. D-Decomposition
603. D-Dimensional c-ary array
604. D-Dimensional c-ary clique
605. D-Dimensional lattice
606. D-Regular tree with boundary
607. D-improper list chromatic number
608. DAG (Directed Acyclic Graph)
609. DFS
610. DFS-tree
611. Dag for basic block
612. Dag of control flow graph
613. Data dependence
614. Data dependence graph
615. Data flow analysis frameworks
616. Data flow analysis problem
617. Data set
618. Data term
619. De Bruijn graph
620. De Bruijn undirected graph
621. Decay number
622. Decidable problem
623. Decision problem
624. Decision problem DIMk
625. Decision tree
626. Decomposable graph
627. Decomposable hammock
628. Decomposable tournament
629. Decomposition
630. Decomposition dimension
631. Defect n-extendable graph
632. Deficiency
633. Deficiency of a bipartite graph
634. Deficiency of a graph
635. Defining set
636. Degenerate tree
637. Degree balanced digraph
638. Degree of a graph
639. Degree of a graph group
640. Degree of a hypergraph edge
641. Degree of an edge
642. Degree pair of a vertex
643. Degree sequence
644. Dense tree
645. Density
646. Dependent set of a matroid
647. Depth-first search (DFS)
648. Depth-first search tree
649. Depth-first spanning forest
650. Depth-first spanning tree
651. Depth of a DAG
652. Depth of a numbering
653. Depth of a tree
654. Depth of a vertex
655. Depth of an arrangeable graph
656. Depth of an arrangement
657. Derivation
658. Derivation tree
659. Derived sequence
660. Descendance graph
661. Descendant
662. Descendant of a vertex
663. Descendent of a vertex
664. Deterministic Turing machine
665. Deterministic automaton
666. Deterministic pushdown automaton
667. Detour
668. Detour center
669. Detour diameter
670. Detour distance
671. Detour dominating set
672. Detour eccentricity
673. Detour order
674. Detour periphery
675. Detour radius
676. Diagonal of a block
677. Diameter
678. Diametral chain
679. Diamond
680. Difference digraph
681. Difference of graphs
682. Differential of a graph
683. Differential of a set
684. Digraph
685. Dijkstra's algorithm
686. Dimension of a poset
687. Dinitz's algorithm
688. Direct product
689. Direct search
690. Directable graph
691. Directed acyclic graph
692. Directed edge
693. Directed forest
694. Directed graph
695. Directed hypergraph
696. Directed hyperpath
697. Directed hypertree
698. Directed multigraph
699. Directed sequence
700. Diregular digraph