Некатегоризованные страницы
Перейти к навигации
Перейти к поиску
Ниже показано до 250 результатов в диапазоне от 501 до 750.
- Connectivity axioms
- Connectivity function
- Connectivity matrix
- Consecutive adjacent graph
- Consecutive labeling
- Constructible graph
- Constructing enumeration
- Constructing order
- Containment graph
- Context-free grammar
- Context-free language
- Context-sensitive grammar
- Context-sensitive language
- Contrabasis
- Contractable edge
- Contracted visibility graph
- Contracting edge, contraction of an edge
- Contraction of a graph
- Contraction of an even pair
- Contrafunctional graph
- Control dependence
- Converse digraph
- Convex bipartite graph
- Convex dominating set
- Convex domination number
- Convex linear graph
- Convex set in G
- Coordinated graph
- Corank function of a matroid
- Core
- Corona
- Cospectral graphs
- Cotree, co-tree
- Countable graph
- Counter automation
- Coverability tree
- Covering cycle
- Covering graph
- Covering set of vertices
- Covering vertex set
- Critical edge
- Critical graph
- Critical kernel-imperfect digraph
- Critical pair
- Critical path
- Critical path method
- Critical set
- Critical tournament
- Critical vertex
- Criticality index
- Critically k-connected graph
- Cross
- Cross-adjacent edges
- Cross-chromatic index
- Cross-free coloring
- Cross-free matching
- Cross-free matching number
- Cross arc
- Cross product
- Crossing number
- Crown
- Crown of graphs
- Cubic graph
- Cubical graph
- Cut-edge
- Cut-vertex
- Cut of a layout
- Cutpoint
- Cutpoint graph
- Cutset
- Cutset matrix
- Cutset matroid
- Cutting set
- Cutting vertex
- Cutvertex
- Cutwidth of a graph
- Cutwidth of a layout
- Cyclability
- Cycle
- Cycle-factor
- Cycle basis
- Cycle complementary
- Cycle cover problem
- Cycle embedding matrix
- Cycle isomorphism
- Cycle matrix
- Cycle matroid
- Cycle space
- Cycle spectrum
- Cycle vector
- Cyclic alternating chain
- Cyclic chromatic number
- Cyclic edge
- Cyclic edge connected vertices
- Cyclic graph
- Cyclic matroid
- Cyclic sequence
- Cyclic vector of a graph
- Cyclomatic complexity of a program
- Cyclomatic matrix
- Cyclomatic number
- 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
- DAG (Directed Acyclic Graph)
- DFS
- DFS-tree
- Dag for basic block
- Dag of control flow graph
- Data dependence
- Data dependence graph
- Data flow analysis frameworks
- Data flow analysis problem
- Data set
- Data term
- De Bruijn graph
- 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 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
- Descendent 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
- Diametral chain
- Diamond
- Difference digraph
- Difference of graphs
- Differential of a graph
- Differential of a set
- Digraph
- Dijkstra's algorithm
- Dimension of a poset
- Dinitz's algorithm
- Direct product
- Direct search
- Directable graph
- Directed acyclic graph
- Directed edge
- Directed forest
- Directed graph
- 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
- Distance between two vertices
- 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