Страницы-сироты
Перейти к навигации
Перейти к поиску
На следующие страницы нет ссылок с других страниц WEGA, и они не включаются в другие страницы.
Ниже показано до 250 результатов в диапазоне от 1 до 250.
- (Informationally) connected operands
- (Informationally) incompatible operands
- (Strong) equivalence of schemas
- (X,Y)-Графы пересечений
- (a,b)-Cut
- (a,b)-Linear class of graphs
- (a,b)-Panconnected graph
- (a,b)-Separator
- (a,b)-Vertex pancyclic graph
- (a,d)-Edge-antimagic total graph
- (a,d)-Edge-antimagic total labeling
- (a,d)-Face antimagic graph
- (g,f)-Factor
- (g,f)-Factorization
- (g,f)-Graph
- (k,d)-Arithmetic graph
- (k,d)-Arithmetic numbering
- (k,d)-Coloring
- (p,q)-Graceful signed graph
- (r,s)-Regular graph
- (t,i,j)-Cover
- 1-Chordal graph
- 1-Factor
- 1-Factorization of K 2n
- 1-edge hamiltonian graph
- 2-3 Brother tree
- 2-Packing number
- 2-Packing of a graph
- 2-Pebbling property
- 2-Switch
- 3-set exact cover problem
- 5-Flow conjecture
- A-reprezentation of a cf-graph
- AT-Free graph
- Abdiff-tolerance competition graph
- Absolute incenter
- Absolute outcenter
- Absolute retract
- Absorbent set
- Abstract computer
- Abstract machine
- Abstract syntax tree
- Access term
- Achromatic status
- Acyclic colouring
- Acyclic dominating set
- Acyclic domination number
- Acyclic orientation
- Additive hereditary graph property
- Addressable transformation graph
- Adjacent forest graph
- Adjacent graphs
- Adjoint digraph
- Advancing arc
- Algebraic connectivity
- Algebraic graph theory
- Alive Petri net
- Alpha-Acyclic hypergraph
- Amalgam
- Amalgamation of a graph
- Amallamorphic graphs
- Amount of a flow
- Ancestor of a vertex
- Annihilator
- Anti-gem
- Antichain
- Anticlique
- Antidependence
- Antimagic graph
- Antiparallel arcs
- Antiprism
- Apex graph
- Approximable problem
- Approximate point spectrum
- Approximation algorithm
- Arbitrarily vertex decomposable graph
- Arboreal hypergraph
- Arborescence
- Arc-forwarding index
- Argument
- Arithmetic graph
- Arrangeable alt
- Articulation set
- Asteroidal set
- Asteroidal triple
- Atomic formula
- Augmenting chain
- Automata theory
- Automorphism group
- Automorphism problem
- Average domination number
- Average independent domination number
- Back-edge
- Backbone coloring number
- Balanced digraph
- Balanced graph
- Ball number
- Bandwidth sum
- Bar-visibility graph
- Basis number
- Berge's Formula
- Berge graph
- Bi-Helly family
- Bichordal bipartite graph
- Biclique edge cover
- Biclique edge covering number
- Biclique number
- Bicoloured subgraph
- Bicomponent
- Bicritical graph
- Bicubic graph
- Bidirectional arcs
- Bigraph
- Binary Hamming graph
- Binary de Bruijn graph
- Binomial tree
- Bipanpositionable graph
- Bipartite bihypergraph
- Bipartite density
- Bipyramid
- Bisection width of a graph
- Bisimplicial edge
- Block-cutvertex tree, block-cutpoint graph
- Block duplicate graph
- Bondy--Chvtal closure operation
- Boundary NCE graph grammar
- Boundary node of a fragment
- Boundary of a 2-mesh
- Bounded tolerance graph
- Breadth first search
- Bridged graph
- Bridgeless graph
- Broadcast digraph
- Brute force'' method
- Bull
- Butterfly graph
- C-Chordal graph
- CKI-орграф
- CPM
- Capacity of a cut-set
- Capacity of an arc
- Cardinal product
- Cardinality constrained circuit problem
- Case term
- Categorical product of graphs
- Caterpillar-pure graph
- Central fringe
- Centroid sequence
- Centroidal vertex
- Chain graph
- Characteristic polynomial of Laplacian
- Choice number
- Choosability
- Chromatic status
- Church's thesis
- Circular-arc graph
- Circular perfect graph
- Circumstance
- Classification of Binary Trees
- Claw
- Claw-free graph
- Clique-partition
- Clique-width
- Clique convergent
- Clique model
- Clique polynomial
- Clique separator
- Clique tree
- Closed hamiltonian neighbourhood
- Cluster
- Clustered graph
- Clutter
- Coadjoint pair
- Coalescing of two rooted graphs
- Cocircuit of a graph
- Cocircuit of a matroid
- Cocomparability number
- Cocomparability ordering
- Codistance
- Cographic matroid
- Color requirement of a vertex
- Coloration
- Coloring number
- Coloured Petri net
- Combinatorial Laplacian
- Combinatorial dual graph, combinatorically dual graph
- Common ancestor
- Common minimal dominating graph
- Common receiver
- Common server
- Compact
- Compact closed class of graphs
- Complement-reducible graph
- Complete coloring
- Complete multipartite graph
- Complete product
- Complete rotation
- Complete system of equivalent transformations
- Completely triangular graph
- Complex windmill
- Complexity theory
- Composite hammock
- Computation
- Concatenation
- Concatenation closure
- Concepts Path Graph
- Conceptual graph
- Condensation
- Cone over a graph
- Conflict
- Confluent NCE graph grammar
- Connected domination number
- Connected hierarchical graph
- Connectivity axioms
- Consecutive adjacent graph
- Consecutive labeling
- Containment graph
- Contractable edge
- Contracted visibility graph
- Contraction of an even pair
- Convex domination number
- Convex set in G
- Coordinated graph
- Core
- Cotree, co-tree
- Coverability tree
- Covering cycle
- Critical kernel-imperfect digraph
- Critical set
- Critical tournament
- Criticality index
- Critically k-connected graph
- Cross arc
- Cross product
- Crown
- Cubical graph
- Cut of a layout
- Cutpoint graph
- Cutwidth of a graph
- Cutwidth of a layout
- Cyclability
- Cycle-factor
- Cycle complementary
- Cycle cover problem
- Cycle isomorphism
- Cycle spectrum
- D-Decomposition
- D-Regular tree with boundary
- D-improper list chromatic number
- DAG (Directed Acyclic Graph)