Некатегоризованные страницы
Материал из WikiGrapp
Ниже показано до 250 результатов в диапазоне от 801 до 1050.
- 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