Тупиковые страницы
Перейти к навигации
Перейти к поиску
Следующие страницы не содержат ссылок на другие страницы в этой вики.
Ниже показано до 250 результатов в диапазоне от 1 до 250.
- (Informationally) connected operands
- (Informationally) incompatible operands
- (Strong) equivalence of schemas
- (X,Y)-Intersection graphs
- (a,b)-Linear class of graphs
- (a,b)-Panconnected graph
- (a,b)-Planar 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
- (p,q)-Graceful signed graph
- (r,s)-Regular graph
- 1-Factor
- 1-Factorization of K 2n
- 1-Tree
- 1-edge hamiltonian graph
- 2-3-Tree
- 2-Packing number
- 2-Packing of a graph
- 2-Pebbling property
- 2-Section graph
- 2-Switch
- 3-set exact cover problem
- 5-Flow conjecture
- A-reprezentation of a cf-graph
- AT-Free graph
- Adjacent graphs
- Arbitrarily traverseable graph
- B-Tree
- BB-Tree
- Brute force'' method
- CF-Language
- CF-grammar
- CS-Grammar
- CS-language
- Closed neighbourhood
- Cluster
- Cocomparability number
- Cocycle
- Common server
- D-Decomposition
- D-Dimensional c-ary array
- D-Dimensional c-ary clique
- D-Dimensional lattice
- D-Regular tree with boundary
- D-improper list chromatic number
- DFS-tree
- Dag of control flow graph
- Data dependence
- Data dependence graph
- Data flow analysis frameworks
- Data flow analysis problem
- Data set
- Data term
- De Bruijn undirected graph
- Decay number
- Decidable problem
- Decision problem
- Decision problem DIMk
- Decision tree
- Decomposable graph
- Decomposable hammock
- Decomposable tournament
- Decomposition
- Decomposition dimension
- Defect n-extendable graph
- Deficiency
- Deficiency of a bipartite graph
- Deficiency of a graph
- Defining set
- Degenerate tree
- Degree balanced digraph
- Degree of a graph
- Degree of a graph group
- Degree of a hypergraph edge
- Degree of an edge
- Degree pair of a vertex
- Degree sequence
- Dense tree
- Density
- Dependent set of a matroid
- Depth-first search (DFS)
- Depth-first search tree
- Depth-first spanning forest
- Depth-first spanning tree
- Depth of a DAG
- Depth of a flow graph
- Depth of a numbering
- Depth of a tree
- Depth of a vertex
- Depth of an arrangeable graph
- Depth of an arrangement
- Derivation
- Derivation tree
- Derived sequence
- Descendance graph
- Descendant
- Descendant of a vertex
- Deterministic Turing machine
- Deterministic automaton
- Deterministic pushdown automaton
- Detour
- Detour center
- Detour diameter
- Detour distance
- Detour dominating set
- Detour eccentricity
- Detour order
- Detour periphery
- Detour radius
- Diagonal of a block
- Diameter
- Diamond
- Difference digraph
- Difference of graphs
- Differential of a graph
- Differential of a set
- Dijkstra's algorithm
- Dimension of a poset
- Dinitz's algorithm
- Direct product
- Direct search
- Directable graph
- Directed acyclic graph
- Directed edge
- Directed forest
- Directed hypergraph
- Directed hyperpath
- Directed hypertree
- Directed multigraph
- Directed sequence
- Diregular digraph
- Dirichlet eigenvalue problem
- Disc
- Disconnected graph
- Discrete matroid
- Disjunct union of graphs
- Dismantlable graph
- Dismantling enumeration
- Dismantling order
- Disorientation of an arc
- Dissection
- Distance
- Distance-hereditary graph
- Distance-transitive graph
- Divider
- Domatic number
- Domatic partition
- Domatically full graph
- Dominance number
- Dominant-covering graph
- Dominant-matching graph
- Dominant set
- Dominating cycle
- Dominating function
- Dominating graph
- Dominating path
- Dominating set
- Dominating vertex
- Dominating walk
- Domination graph
- Domination graph (of a tournament)
- Domination number
- Domination number relative to v
- Domination perfect graph
- Domination subdivision number
- Dominator
- Dominator tree
- Domino
- Domsaturation number
- Double competition number
- Double dominating set
- Double domination number
- Double edge dominating set
- Double edge domination number
- Double ray
- Double rotation
- Double star
- Doubly chordal graph
- Doubly perfect ordering
- Doubly regular tournament
- Doubly simplicial vertex
- Doubly stochastic matrix
- Dual graph
- Dual hypergraph
- Dual hypertree
- Dual map
- Dual matroid
- Dual tournament
- Dually chordal graph
- Dually compact closed class of graphs
- Dudeney's round table problem
- Dudeney set
- E-Free grammar
- E-Free сoncatenation closure
- Eccentric graph
- Eccentric sequence
- Eccentricity of a vertex
- Edge
- Edge-cordial graph
- Edge-cordial labeling
- Edge-cover
- Edge-critical graph
- Edge-degree
- Edge-forwarding index
- Edge-graceful graph
- Edge-graceful labeling
- Edge-independent number
- Edge-integrity
- Edge-labeling
- Edge-magic total graph
- Edge-magic total labeling
- Edge-ordering
- Edge-pancyclic graph
- Edge-pancyclicity
- Edge-ranking of a graph
- Edge-superconnectivity
- Edge adding
- Edge chromatic number
- Edge clique cover
- Edge clique cover number
- Edge colourable graph
- Edge connectivity
- Edge connectivity number
- Edge core
- Edge covering
- Edge critical graph
- Edge cut, edge cut set
- Edge density
- Edge dominating set
- Edge domination number
- Edge graph
- Edge group of a graph
- Edge incidency matrix
- Edge isomorphic graphs
- Edge k-colourable graph
- Edge k-colouring
- Edge kernel
- Edge list
- Edge monochromatic class
- Edge of a hypergraph
- Edge of attachment
- Edge reconstructibility
- Edge regular graph
- Edge space