Некатегоризованные страницы
Перейти к навигации
Перейти к поиску
Ниже показано до 500 результатов в диапазоне от 751 до 1250.
- 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
- E-Правило
- E k-Cordial graph
- Eccentric graph
- Eccentric sequence
- Eccentricity of a vertex
- Economy region
- 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-isoperimetric problem
- 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 path cover
- Edge path number
- Edge ranking number
- Edge reconstructibility
- Edge regular graph
- Edge space
- Edge symmetric graph
- Edge t-ranking
- Effectively solvable problem
- Efficient dominating set
- Eigenvalue of a graph
- Element of a graph
- Elementary Petri net
- Elementary homomorphism
- Embedding of a graph
- Emptiness problem
- Empty deadend
- Empty deadlok
- Empty graph
- Empty hypergraph
- Empty loop
- Empty marking problem
- Empty problem
- Empty string
- Empty subgraph
- Empty symbol
- Empty tree
- Enabled transition
- Enclosure transition
- End-edge
- Endblock
- Endline graph
- Endomorphism
- Endpoint, end-vertex
- Endpoints of a path (chain)
- Energy of graph
- Entire choice number
- Entire chromatic number
- Entire colouring
- Entry
- Entry node of a fragment
- Entry vertex
- Entry vertex of a subgraph
- Environment of a vertex
- Equally coloured vertices
- Equiseparable trees
- Equistable graph
- Equitable partition
- Equivalence of languages problem
- Equivalence problem
- Equivalence relation
- Equivalent cycles
- Equivalent derivations
- Equivalent grammars
- Equivalent program schemata
- Equivalent programs
- Erdos--Gallai criterion
- Essential arc
- Essential independent set
- Euler's formula
- Euler graph
- Eulerian chain
- Eulerian circuit
- Eulerian cycle
- Eulerian digraph
- Eulerian graph
- Eulerian tour
- Eulerian trail
- Evaluated graph
- Evaluation of a graph
- Even component
- Even contractile graph
- Even 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
- Exhaustive search
- Exit
- Exit node of a fragment
- Exponent of a digraph
- Expression DAG
- Expression dag
- Extended odd graph
- Extended regular expression
- Exterior face
- Exterior of a cycle
- External input place
- External output place
- External place
- External stability set
- F-Arc
- F-Direct arc
- F-Dominating cycle
- F-Factor
- F-Heap
- F-Inverse arc
- F-Line
- F-Matching width
- F-Orthogonal subgraph
- F-Path
- F-Rank
- F-Ray
- F-Reachable (from p) node
- F-Region
- F-Stability number
- F-Stable set
- F-Width (of a hypergraph)
- F-Достижимость
- F-Дуга
- F-Линия
- F-Луч
- F-Область
- F-Прямая дуга
- F-Путь
- F-Ранг
- F-Фактор
- FAS-problem
- FVS-problem
- Face
- Facet
- Facial cycle
- Factor-cf-graph
- Factor-critical graph
- Factor-graph
- Factorization
- Factorization of a graph
- Father of a vertex
- Feedback arc set
- Feedback vertex set
- Fibonacci heap
- Fibre
- Filter
- Final substring
- Finish vertex
- Finishing node of fragment
- Finite automaton
- Finite graph
- Finite tree
- Finiteness problem
- First Order formula
- Five-color theorem
- Fixed vertex
- Flag
- Flat forest
- Flow
- Flow-diagram
- Flow-equivalent graphs
- Flow augmenting path
- Flow control
- Flow dependence
- Flower
- Forbidden subgraph
- Forcing number
- Forcing set
- Ford-Fulkerson's theorem
- Forest-perfect graph
- Forest graph
- Formal language
- Formal language theory
- Forward arc
- Foundtion of G-trade
- Fractional-chromatic number
- Fractional-coloring
- Fractional clique number
- Fractional k-factor
- Fractional matching
- Fractional matching number
- Fragment
- Frame
- Framing number
- Fraternal orientation
- Fraternally orientable digraph
- Fraternally oriented digraph
- Free-choice Petri net
- Free Petri net
- Free language
- Free tree
- Frequency-ordered binary search tree
- Fully disconnected graph
- Functional directed graph
- Functional vertex
- Functionally equivalent program schemata
- Functionally equivalent programs
- Fundamental circuit
- Fundamental cutset matrix
- Fundamental cycle matrix
- Fundamental set of circuits
- Fundamental set of cutsets
- G-Matching function
- G-Trade
- G-Vertex regular graph
- G-Отображающая функция
- Game-chromatic number
- Game domination number
- Gamma-Finite graph
- Gamma-Restricted graph
- Gamma^-1-Finite graph
- Gamma t(G)-Excellent graph
- Gem
- General graph
- General phrase-structure grammar
- Generalized Kautz digraph
- Generalized Petersen graph
- Generalized binary split tree
- Generalized competition graph
- Generalized de Bruijn graph
- Generalized interval order
- Generalized semiorder
- Generating function
- Genus of a graph
- Geodesically convex set of vertices
- Geodetic chain
- Geodetic graph
- Geometric dual graph
- Geometric realization of graph
- Girth
- Global density
- Global forcing number
- Global forcing set
- Global irregularity of a digraph
- Global strong alliance number
- Global w-density
- Gossip graph
- Gossiping problem
- Graceful graph
- Graft
- Grammar of type 0
- Grammar rule
- Graph, undirected graph, nonoriented graph
- Graph Clustering Problem
- Graph Minor Theorem
- Graph automorphism group
- Graph bundle
- Graph capacity
- Graph circuit space
- Graph cutset space
- Graph enumeration
- Graph grammar
- Graph isomorphism
- Graph labeling
- Graph morphism
- Graph of a partial order
- Graph of a strict partial order
- Graph of finite automata
- Graph of function
- Graph of reachable markings
- Graph representation
- Graph rewriting system (with priorities)
- Graph spectral theory
- Graph symmetry number
- Graph transformation rule
- Graph union
- Graph with boundary
- Graphic sequence of numbers
- Graphical (graphic) matroid
- Graphical partition of a number
- Graphical sequence of numbers
- Graphical trade
- Graphoid
- Graphs union
- Greedy algorithm
- Grid graph
- Group graph
- Group of a directed graph
- Growing tree
- Grundy colouring
- Grundy number
- Gupta scheme
- H-Connected graphs
- H-Covering, H-Covering set
- H-Saturated graph
- H-Tree
- H-Uniform hypergraph
- H-adjacent graphs
- H-decomposition number
- H-distance
- H-forming number
- H-forming set
- H-path
- H-tuple domination
- H-Дерево
- HB-Tree
- HB-Дерево
- HHD-free graph
- HS-Tree
- HS-Дерево
- Hadwiger number
- Halin graph
- Hamiltonian center
- Hamiltonian chain
- Hamiltonian circuit
- Hamiltonian connected graph
- Hamiltonian cycle
- Hamiltonian decomposable graph
- Hamiltonian digraph
- Hamiltonian graph
- Hamiltonian path
- Hamming distance
- Hamming graph
- Hammock
- Hammock presentation
- Handshake's lemma
- Harmonious chromatic number
- Head of a hyperarc
- Head place
- Heap
- Heap-ordered tree
- Heap order
- Heawood number
- Height of a branch of a tree
- Height of a tree
- Height of a vertex
- Helly hypergraph
- Helly property
- Hereditary class of graphs
- Hereditary dually chordal graph
- Hereditary property of a graph
- Hierarchical Petri net
- Hierarchical graph
- Hierarchy of embedded alts
- Hierarchy of embedded zones
- Hierarchy of nested alts
- High-level Petri nets
- Hilbert's problem
- Hole
- Homeomorphical graphs
- Homeomorphically irreducible tree
- Homogeneously embedded graph
- Homomorphic image of a graph
- Homomorphism of a graph
- Honest graph
- House
- Hungarian method
- Hyper Petersen graph
- Hyper de Bruijn graph
- Hyperarc
- Hypercube
- Hypercycle
- Hypergraph
- Hypertree
- Hypohamiltonian graph
- I-Tree
- I-Грамматика
- Identical group of a graph
- Immediate dominator
- Immediate postdominator
- 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
- Incomparable vertices
- Incompatibility graph
- Increment operator
- Indecomposable tournament
- Indegree, in-degree
- Indegree matrix
- Independence graph of a graph
- Independence number
- Independence polynomial
- Independence subdivision number
- Independent F-matching width
- Independent F-width
- Independent circuits
- Independent dominating number
- Independent dominating set
- Independent domination number relative to v
- Independent edges
- Independent matching width
- Independent n-domination number
- Independent paths
- Independent set
- Independent sets of a matroid
- Independent vertex set of a hypergraph
- Independent width
- Index
- Indifference digraph
- Indifference graph
- Indirect addressing graph
- Induced (with vertices) subgraph
- Induced matching partition number
- Induced path number
- Inductive graph
- Infinite graph
- Inflation
- Information flow
- Information graph
- Informationally connected operands
- Informationally incompatible operands
- Inheritance graph
- Inheritance relation
- Inhibitor Petri net
- Inhibitor arc
- Initial marking
- Initial node
- Initial state
- Initial string
- Initial symbol
- Inner vertex
- Inorder traversal
- Input
- Input arc
- Input directed spanning tree
- Input place
- Input tree
- Inradius
- Inseparation number
- Inset
- Integer distance graph
- Integral graph
- Integrity
- Internal transition
- Interpretation
- Intersection graph
- Intersection number
- Intersection of graphs