Страницы-сироты
Материал из WikiGrapp
На следующие страницы нет ссылок с других страниц WikiGrapp, и они не включаются в другие страницы.
Ниже показано до 250 результатов в диапазоне от 501 до 750.
- Graph transformation rule
- Graph union
- Graph with boundary
- Graphic sequence of numbers
- Graphical (graphic) matroid
- Graphical trade
- H-Covering, H-Covering set
- H-Saturated graph
- H-Tree
- H-adjacent graphs
- H-decomposition number
- H-forming number
- H-forming set
- H-path
- H-tuple domination
- HHD-free graph
- Hamiltonian decomposable graph
- Hamiltonian digraph
- Head of a hyperarc
- Head place
- Heap
- Heap-ordered tree
- Heap order
- Height of a branch of a tree
- Height of a tree
- Height of a vertex
- Hereditary class of graphs
- Hereditary dually chordal graph
- Hierarchical Petri net
- Hierarchy of embedded alts
- Hierarchy of embedded zones
- Hilbert's problem
- Homogeneously embedded graph
- Honest graph
- House
- Hyper Petersen graph
- Hyper de Bruijn graph
- Hyperarc
- I-Tree
- I-Грамматика
- 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
- Increment operator
- Indecomposable tournament
- Indegree, in-degree
- Independence graph of a graph
- Independence polynomial
- Independence subdivision number
- Independent F-matching width
- Independent F-width
- Independent dominating number
- Independent dominating set
- Independent domination number relative to v
- Independent matching width
- Independent n-domination number
- Independent paths
- Independent width
- Indirect addressing graph
- Induced matching partition number
- Induced path number
- Inflation
- Information flow
- Informationally connected operands
- Informationally incompatible operands
- Inheritance graph
- Inheritance relation
- Inhibitor Petri net
- Inhibitor arc
- Initial state
- Initial string
- Initial symbol
- Input place
- Inset
- Integer distance graph
- Integral graph
- Integrity
- Internal transition
- Interpretation
- Interval I(u,v)
- Interval chromatic number
- Interval coloring
- Interval of a tournament
- Inverse relation
- Irreducible additive hereditary graph property
- Irredundance number
- Irredundance perfect graph
- Irredundant Petri net
- Irregular digraph
- Irregular graph
- Irregularity of a digraph
- Irregularity strength
- Isolated vertex subset
- Isomorphic decomposition
- Isomorphic posets
- Isospectral graphs
- Isotropic coloring
- Iteration operation
- Join operation
- Jump distance
- Jump graph
- K-Binding number
- K-Bounded Petri net
- K-Case term
- K-Choosable graph
- K-Chorded bigraph
- K-Closure of a graph
- K-Cocomparability ordering
- K-Cover of a (hyper)graph
- K-Cyclable graph
- K-Cyclic chromatic number
- K-Cyclic coloring
- K-Diameter
- K-Dimensional poset
- K-Distance
- K-Dominating cycle
- K-Edge-connected graph
- K-Equitable graph
- K-Equitable labeling
- K-Factorable graph
- K-Game-colorable graph
- K-Irredundance perfect graph
- K-Iterated line digraph
- K-Jump graph
- K-Matching
- K-Minus-critical graph
- K-Ordered Hamiltonian graph
- K-Outerplanar graph
- K-Outpath
- K-Pan
- K-Path graph
- K-Placement
- K-Ranking
- K-Recognizer
- K-Restricted total domination number
- K-Sequentially additive graph
- K-Sequentially additive labeling
- K-Snark
- K-Stability
- K-Sun
- K-Walk
- K-Wide diameter
- K-Wide distance
- K-covering cycle
- 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-Транзитивная группа графа
- KP-орграф
- K\"onigsberg's bridges problem
- Karp-Miller tree
- Kautz digraph
- Kernel-perfect digraph
- Kings graph
- Kirchoff matrix
- Kleene closure
- Kleene star
- Knödel graph
- Krausz dimension of a graph
- Krausz partition of a graph
- Kronecker product
- Kruskal's algorithm
- Kuratowski's criterion
- Kuratowski's theorem
- L-Total coloring
- L-Веер
- L-Соединимость
- L-Цикл
- Labeled Petri net, Labelled Petri net
- Labeled tree, Labelled tree
- Labeling of type (a,b,c)
- Ladder
- Language
- Laplacian eigenvalues
- Laplacian spectral radius
- Laplacian spectrum
- Large-block program
- Large-block program execution
- Leaf density
- Least upper bound
- Left-sided balanced tree
- Length of a circuit
- Length of a hypercycle
- Length of a path
- Length of a string
- Length of a vertex
- Letter
- Lexicographic product
- Light edge
- Light graph
- Limit flow graph
- Line
- Line graph of a mixed graph
- Linear NCE graph grammar
- Linear arrangement
- Linear bounded automaton
- Linear extension of a poset
- Linear forest
- Linear hypergraph
- Linear k-arboricity of a graph
- Linear k-forest
- Linear layout
- Linear matroid
- Linear order
- Linear vertex arboricity
- Liouville property of an operator on graphs
- 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 exponent of digraph
- Local independence number
- Local input place
- Local irregularity of a digraph
- Local isomorphism
- Local output place
- Local place
- Local tree-width
- Locally k-connected graph
- Locally longest with respect to M cycle
- Locally semicomplete digraph
- Locating-dominating set
- Locating set
- Location-domination number
