Некатегоризованные страницы
Перейти к навигации
Перейти к поиску
Ниже показано до 250 результатов в диапазоне от 1251 до 1500.
- 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