Страницы-сироты
Перейти к навигации
Перейти к поиску
На следующие страницы нет ссылок с других страниц WikiGrapp, и они не включаются в другие страницы.
Ниже показано до 250 результатов в диапазоне от 101 до 350.
- 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
- 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-Chvatal 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
- Composite hammock
- Computation
- Concatenation
- Concatenation closure
- Condensation
- Cone over a graph
- Conflict
- Confluent NCE graph grammar
- Connected dominating set
- 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)
- DFS
- DFS-tree
- Data term
- De Bruijn undirected graph
- Decay number
- Decidable problem
- Decision problem DIMk
- Decomposable graph
- Decomposable hammock
- Decomposable tournament
- Decomposition
- Decomposition dimension
- Defect n-extendable graph
- Deficiency
- Deficiency of a graph
- Defining set
- Degree balanced digraph
- Degree pair of a vertex
- Dense tree
- Dependent set of a matroid
- Depth of a DAG
- Depth of a flow graph
- Depth of an arrangeable graph
- Depth of an arrangement
- Derivation tree
- Descendance graph
- 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
- Difference digraph
- Differential of a graph
- Differential of a set
- Dijkstra's algorithm
- Dimension of a poset
- Dinitz's algorithm
- Direct search
- Directed edge
- Directed hypertree
- Diregular digraph
- Dirichlet eigenvalue problem
- Disc
- Dismantling enumeration
- Dismantling order
- Divider
- Domatic number
- Domatic partition
- Domatically full graph
- Dominant-covering graph
- Dominant-matching graph
- Dominant set
- Dominating function
- Dominating graph
- Dominating path
- Dominating walk
- Domination graph (of a tournament)
- Domination number
- Domination number relative to v
- Domination perfect graph
- Domination subdivision number
- Domsaturation number
- Double dominating set
- Double domination number
- Double edge dominating set
- Double edge domination number
- Double ray
- Double star
- Doubly regular tournament
- Doubly simplicial vertex
- Drawing of graph
- Dual hypertree
- Dual map
- Dual tournament
- Dually compact closed class of graphs
- Dudeney's round table problem
- Dudeney set
- E-Free сoncatenation closure
- E-переход
- E k-Cordial graph
- Eccentric graph
- Eccentric sequence
- Edge-cordial graph
- Edge-cordial labeling
- Edge-cover
- Edge-degree
- Edge-forwarding index
- Edge-graceful labeling
- Edge-independent number
- Edge-integrity
- Edge-isoperimetric problem
- Edge-labeling
- Edge-magic total graph
- Edge-magic total labeling
- Edge-ordering