Некатегоризованные страницы
Перейти к навигации
Перейти к поиску
Ниже показано до 500 результатов в диапазоне от 1051 до 1550.
- 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
- Interval I(u,v)
- Interval chromatic number
- Interval coloring
- Interval function
- Interval graph
- Interval hypergraph
- Interval of a graph
- Interval of a tournament
- Interval order
- Intractable problem
- Invariant of a graph
- Inverse arborescence
- Inverse cycle
- Inverse relation
- Irreducible additive hereditary graph property
- Irreducible graph
- Irredundance number
- Irredundance perfect graph
- Irredundant Petri net
- Irredundant set
- Irreflexive relation
- Irregular digraph
- Irregular graph
- Irregularity of a digraph
- Irregularity strength
- Isolated vertex
- Isolated vertex of a hypergraph
- Isolated vertex subset
- Isometric subgraph
- Isomorphic decomposition
- Isomorphic directed graphs
- Isomorphic embedding problem
- Isomorphic graphs
- Isomorphic labeled graphs
- Isomorphic matroids
- Isomorphic posets
- Isomorphism problem
- Isoperimetric number
- Isospectral graphs
- Isotropic coloring
- Iterated clique graph
- Iteration operation
- J-Pancyclic graph
- J-Панциклический граф
- Join of graphs
- Join operation
- Joined vertices
- Jump distance
- Jump graph
- Justified tree
- K-Binding number
- K-Bounded Petri net
- K-Bunch
- K-Bunch isomorphic graph
- K-Case term
- K-Choosable graph
- K-Chorded bigraph
- K-Chromatic graph
- K-Chromatic hypergraph
- K-Closure of a graph
- K-Cocomparability ordering
- K-Colorable graph
- K-Colorable hypergraph
- K-Colorable map
- K-Colored graph
- K-Colored hypergraph
- K-Coloring
- K-Connected component
- K-Connected graph
- K-Connected vertices
- K-Convergent
- K-Cover of a (hyper)graph
- K-Cyclable graph
- K-Cyclic chromatic number
- K-Cyclic coloring
- K-Cyclic colouring
- K-Diameter
- K-Dimensional poset
- K-Distance
- K-Divergent graph
- K-Dominating cycle
- K-Edge-connected graph
- K-Edge connected graph
- K-Equitable graph
- K-Equitable labeling
- K-Factor of a graph
- K-Factorable graph
- K-Factorizable graph
- K-Flow
- K-Game-colorable graph
- K-Irredundance perfect graph
- K-Iterated line digraph
- K-Jump graph
- K-Matching
- K-Minus-critical graph
- K-Null graph
- K-Numbering
- K-Ordered Hamiltonian graph
- K-Outerplanar graph
- K-Outpath
- K-Pan
- K-Partite graph
- K-Path graph
- K-Placement
- K-Ranking
- K-Recognizer
- K-Restricted total domination number
- K-Saturated graph
- K-Separability
- K-Sequentially additive graph
- K-Sequentially additive labeling
- K-Snark
- K-Stability
- K-Sun
- K-Transitive graph
- K-Transitive group of a graph
- K-Tree
- K-Tree with small height
- K-Unitransitive graph
- K-Vertex connected graph
- K-Walk
- K-Wide diameter
- K-Wide distance
- K-covering cycle
- K-d-Tree
- K-d-Дерево
- K-invariant graph
- K-path
- K-reconstructible graph
- K-reconstruction of a graph
- K-restricted domination number
- K-th Neighborhood of a vertex
- K-th Power of a graph
- K-γ-Critical graph
- K-Вершинно-связный граф
- K-Дерево
- K-Дерево малой высоты
- K-Дольный граф
- K-Кратная конкатенация цепочек
- K-Насыщенный граф
- K-Нумерация
- K-Отделимость
- K-Поток
- K-Пучково-изоморфные графы
- K-Пучок
- K-Размещение
- K-Раскраска
- K-Раскрашенный граф
- K-Раскрашиваемая карта
- K-Раскрашиваемый граф
- K-Реберно связный граф
- K-Связный граф
- K-Транзитивная группа графа
- K-Транзитивный граф
- K-Унитранзитивный граф
- K-Хроматический граф
- K-Циклическая раскраска
- KB-Tree
- KB-Дерево
- KP-орграф
- K\"onigsberg's bridges problem
- Karp-Miller tree
- Kautz digraph
- Kempe's equality
- Kernel
- Kernel-perfect digraph
- Kernel of a digraph
- Keyed access method
- Kings graph
- Kirchoff matrix
- Kleene closure
- Kleene star
- Knot graph
- Knödel graph
- Konig's problem
- Krausz dimension of a graph
- Krausz partition of a graph
- Kronecker product
- Kruskal's algorithm
- Kuratowski's criterion
- Kuratowski's theorem
- L-Attribute grammar
- L-Coloring with impropriety d
- L-Fan
- L-Geodetic graph
- L-Joinability
- L-Loop
- L-Numbering
- L-Ordered grammar
- L-Total coloring
- L-Атрибутная грамматика
- L-Веер
- L-Геодезический граф
- L-Нумерация
- L-Соединимость
- L-Упорядоченные грамматики
- L-Цикл
- Label
- Labeled Petri net, Labelled Petri net
- Labeled graph, labelled graph
- Labeled tree, Labelled tree
- Labeling
- Labeling of type (a,b,c)
- Ladder
- Language
- Laplacian eigenvalues
- Laplacian matrix
- Laplacian spectral radius
- Laplacian spectrum
- Large-block program
- Large-block program execution
- Large-block program schemata
- Large-block schema
- Lattice graph
- Lavrov schemata
- Layout
- Leaf
- Leaf density
- Learning Paths Graph
- Least upper bound
- Lee scheme
- Left-derivation tree
- Left-sided balanced tree
- Left linear tree
- Leftmost derivation
- Length of a chain
- Length of a circuit
- Length of a cycle
- Length of a hypercycle
- Length of a path
- Length of a string
- Length of a vertex
- Length of an arc
- Letter
- Level representation of rooted trees
- Lexicographic order
- Lexicographic product
- Light edge
- Light graph
- Limit flow graph
- Line
- Line-chromatic number
- Line-covering number
- Line-independence number
- Line-symmetric graph
- Line covering
- Line digraph
- Line graph
- Line graph of a hypergraph
- Line graph of a mixed graph
- Line group of a graph
- Line incident with a vertex
- Linear-bounded automation
- Linear NCE graph grammar
- Linear arrangement
- Linear bounded automaton
- Linear component
- Linear extension of a poset
- Linear forest
- Linear hypergraph
- Linear k-arboricity of a graph
- Linear k-forest
- Linear layout
- Linear layout of a tree
- Linear matroid
- Linear order
- Linear scheme (code, presentation)
- Linear subgraph of a directed graph
- Linear subgraph of a graph
- Linear tree
- Linear vertex arboricity
- Liouville property of an operator on graphs
- List assignment
- List chromatic number
- List coloring
- List edge-coloring problem
- List edge chromatic number
- List homomorphism
- List total coloring
- List total coloring problem
- List vertex-coloring problem
- Live transition
- Liveness problem
- Local-edge-connectivity
- Local computation on graphs
- Local exponent of digraph
- Local independence number
- Local input place
- Local irregularity of a digraph
- Local isomorphism
- Local output place
- Local place
- Local replacement method
- Local tree-width
- Locally countable graph
- Locally finite graph
- Locally k-connected graph
- Locally longest with respect to M cycle
- Locally restricted graph
- Locally semicomplete digraph