Страницы-сироты
Перейти к навигации
Перейти к поиску
На следующие страницы нет ссылок с других страниц WikiGrapp, и они не включаются в другие страницы.
Ниже показано до 500 результатов в диапазоне от 101 до 600.
- 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
- Edge-pancyclic graph
- Edge-pancyclicity
- Edge-superconnectivity
- Edge clique cover
- Edge clique cover number
- Edge density
- Edge dominating set
- Edge domination number
- Edge group of a graph
- Edge of a hypergraph
- Edge ranking number
- Edge space
- Effectively solvable problem
- Elementary Petri net
- Emptiness problem
- Empty deadend
- Empty deadlok
- Empty loop
- Empty marking problem
- Empty string
- Empty subgraph
- Empty symbol
- Empty tree
- Enabled transition
- Enclosure transition
- Endline graph
- Endpoint, end-vertex
- Endpoints of a path (chain)
- Energy of graph
- Entire choice number
- Entire chromatic number
- Entire colouring
- Entry node of a fragment
- Equiseparable trees
- Equistable graph
- Equitable partition
- Equivalence of languages problem
- Equivalent cycles
- Equivalent derivations
- Equivalent program schemata
- Equivalent programs
- Erdos--Gallai criterion
- Essential independent set
- Euler graph
- Eulerian tour
- Even component
- Even contractile graph
- Even pair
- Event
- Event-condition system
- Event condition
- Event realization
- Exact double dominating set
- Exact n-step dominating set
- Exact n-step domination graph
- Exceptional graph
- Exclusion operation
- Execution of Petri net
- Execution of large-block schema
- Execution sequence
- Exit node of a fragment
- Exponent of a digraph
- Exterior face
- External input place
- External output place
- External place
- F-Arc
- F-Dominating cycle
- F-Heap
- F-Inverse arc
- F-Matching width
- F-Orthogonal subgraph
- F-Stability number
- F-Stable set
- F-Width (of a hypergraph)
- FAS-problem
- FVS-problem
- Facial cycle
- Factor-cf-graph
- Factor-critical graph
- Feedback arc set
- Feedback vertex set
- Fibre
- Filter
- Final substring
- Finish vertex
- Finishing node of fragment
- Finite automaton
- Finiteness problem
- First Order formula
- Five-color theorem
- Fixed vertex
- Flag
- Flat forest
- Flow-diagram
- Flow-equivalent graphs
- Flow augmenting path
- Flow control
- Flow dependence
- Flower
- Forcing number
- Ford-Fulkerson's theorem
- Forest-perfect graph
- Foundtion of G-trade
- Fractional-coloring
- Fractional clique number
- Fractional k-factor
- Fractional matching
- Fractional matching number
- Frame
- Framing number
- Fraternal orientation
- Fraternally orientable digraph
- Fraternally oriented digraph
- Free-choice Petri net
- Free Petri net
- Functionally equivalent program schemata
- Functionally equivalent programs
- G-Trade
- G-Vertex regular graph
- G-Отображающая функция
- Game domination number
- Gamma-Finite graph
- Gamma-Restricted graph
- Gamma^-1-Finite graph
- Gamma t(G)-Excellent graph
- General phrase-structure grammar
- Generalized Kautz digraph
- Generalized Petersen graph
- Generalized de Bruijn graph
- Generalized reducible graph
- Generalized semiorder
- Geodesically convex set of vertices
- Geometric dual graph
- Geometric realization of graph
- Global density
- Global forcing number
- Global forcing set
- Global irregularity of a digraph
- Global strong alliance number
- Global w-density
- Gossip graph
- Graft
- Grammar rule
- Graph Clustering Problem
- Graph Minor Theorem
- Graph bundle
- Graph of finite automata
- Graph of function
- Graph spectral theory
- Graph transformation rule
- Graph union
- Graph with boundary
- Graphic sequence of numbers
- Graphical (graphic) matroid
- Graphical trade
- H-Covering, H-Covering set
- H-Saturated graph
- H-Tree
- H-adjacent graphs
- H-decomposition number
- H-forming number
- H-forming set
- H-path
- H-tuple domination
- HHD-free graph
- Hamiltonian decomposable graph
- Hamiltonian digraph
- Head of a hyperarc
- Head place
- Heap
- Heap-ordered tree
- Heap order
- Height of a branch of a tree
- Height of a tree
- Height of a vertex
- Hereditary class of graphs
- Hereditary dually chordal graph
- Hierarchical Petri net
- Hierarchy of embedded alts
- Hierarchy of embedded zones
- Hilbert's problem
- Homogeneously embedded graph
- Honest graph
- House
- Hyper Petersen graph
- Hyper de Bruijn graph
- Hyperarc
- I-Tree
- I-Грамматика
- Immersion
- Immovable vertex
- Impropriety
- In-neighborhood
- In-semicomplete digraph
- In-tree
- Incenter
- Incidence function labelling
- Incidence graph
- Incidence matrix
- Incidence relation
- Inclusion of languages problem
- Inclusion of schemas
- Inclusion tree
- Increment operator
- Indecomposable tournament
- Indegree, in-degree
- Independence graph of a graph
- Independence polynomial
- Independence subdivision number
- Independent F-matching width
- Independent F-width
- Independent dominating number
- Independent dominating set
- Independent domination number relative to v
- Independent matching width
- Independent n-domination number
- Independent paths
- Independent width
- Indirect addressing graph
- Induced matching partition number
- Induced path number
- Inflation
- Information flow
- Informationally connected operands
- Informationally incompatible operands
- Inheritance graph
- Inheritance relation
- Inhibitor Petri net
- Inhibitor arc
- Initial state
- Initial string
- Initial symbol
- Input place
- Inset
- Integer distance graph
- Integral graph
- Integrity
- Internal transition
- Interpretation
- Interval I(u,v)
- Interval chromatic number
- Interval coloring
- Interval of a tournament
- Inverse relation
- Irreducible additive hereditary graph property
- Irredundance number
- Irredundance perfect graph
- Irredundant Petri net
- Irregular digraph