Все страницы
Перейти к навигации
Перейти к поиску
- 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-Транзитивный граф
- 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
- Kn\"odel graph
- 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-Цикл
- LARGE graph
- 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
- Large graph
- Large graph mining methods
- Large graph mining systems
- Large small graph
- Lattice graph
- Lavrov schemata
- Layout
- Layout of a graph
- Leaf
- Leaf density
- 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
- Limit 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
- Locating-dominating set
- Locating set
- Location-domination number
- Location number
- Logic for expressing graph properties
- Loop
- Loop of matroid
- Loop region
- Lower independence number
- M-Ary tree
- M-Choosable graph with impropriety d
- M-Convex set in G
- M-Convexity number
- M-Numbering
- M-Нумерация
- MAXIMUM FLOW problem
- MAXIMUM INDEPENDENT SET problem
- MIDS problem
- MINIMUM FILL-IN problem
- MINIMUM GRAPH COLORING problem
- MINIMUM VERTEX COVER problem
- Magic labeling
- Magnet in a graph
- Magnitude of a flow
- Main eigenvalue
- Majority dominating function
- Majority domination number
- Map
- Mark
- Marked graph
- Marked trap
- Marker
- Marking
- Marking operation
- Marriage problem
- Martynyuk schemata
- Matching
- Matching equivalent
- Matching number
- Matching polynomial
- Matching width
- Matrix-tree theorem
- Matrix graph
- Matrix matroid
- Matroid
- Matroid cocycle space
- Matroid connectivity
- Matroid cycle space
- Matthews graph
- Max-flow min-cut theorem
- Maxclique
- Maximal complete subgraph
- Maximal dominating set
- Maximal domination number
- Maximal exclusion graph
- Maximal flow
- Maximal independence number
- Maximal packing
- Maximal singular graph
- Maximal strongly singular graph
- Maximal subnet
- Maximal tree
- Maximally irregular graph
- Maximum-cardinality matching
- Maximum edge-connected graph
- Maximum hyperflow problem
- Maximum matching graph
- Maximum neighbour
- Maximum neighbourhood ordering
- Maximum point-connected graph
- McGee graph
- Mean diameter
- Median generalized binary split tree
- Median graph
- Median split tree
- Membership problem
- Memory state
- Menger's theorem
- Mergeable heap
- Metric-locating-dominating set
- Metric-location-domination number
- Metric dimension
- Middle graph
- Minimal connected graph
- Minimal dominating graph
- Minimal flow
- Minimal imperfect graph
- Minimal irredundance imperfect graph
- Minimal separator
- Minimal triangulation
- Minimum broadcast graph
- Minimum cost hyperflow problem
- Minimum gossip graph
- Minimum independent dominating set problem
- Minimum separator
- Minimum t-spanner problem
- Mining with diffusion neighborhoods
- Mining with generalized matrix-vector products
- Mining with geodesic neighborhoods
- Minor-closed class of graphs
- Minor of a graph
- Minsky machine
- Minus dominating function
- Minus domination number
- Mixed graph
- Mode
- Mode vertex
- Model of computation
- Module of a graph
- Monadic Second Order formula
- Monge graph
- Monochromatic class (set)
- Monotone transitive graph
- Monotonicity property
- Mu-Excellent graph
- Multi-coloring
- Multicrown
- Multidimensional B-tree
- Multidimensional search tree
- Multientry zone
- Multigraph
- Multigraph of strength s
- Multiple arcs
- Multiple domination
- Multiple edges
- Multiplicity
- Multiplicity of a covering