Страницы-сироты
Перейти к навигации
Перейти к поиску
На следующие страницы нет ссылок с других страниц WikiGrapp, и они не включаются в другие страницы.
Ниже показано до 500 результатов в диапазоне от 501 до 1000.
- 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
- Location number
- Lower independence number
- M-Choosable graph with impropriety d
- M-Convex set in G
- 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
- Marked graph
- Marked trap
- Marker
- Marking operation
- Matching equivalent
- Matching polynomial
- Matching width
- Matrix graph
- Matroid connectivity
- Matthews graph
- Max-flow min-cut theorem
- Maximal complete subgraph
- Maximal dominating set
- Maximal domination number
- Maximal flow
- Maximal independence number
- Maximal packing
- Maximal subnet
- Maximally irregular graph
- Maximum-cardinality matching
- Maximum hyperflow problem
- Maximum matching graph
- Maximum neighbour
- Maximum neighbourhood ordering
- Median generalized binary split tree
- Median graph
- Memory state
- Menger's theorem
- Metric-locating-dominating set
- Metric-location-domination number
- Metric dimension
- Middle graph
- Minimal dominating graph
- Minimal imperfect graph
- Minimal irredundance imperfect graph
- Minimal separator
- Minimal triangulation
- Minimum cost hyperflow problem
- Minimum gossip graph
- Minimum independent dominating set problem
- Minimum separator
- Minimum t-spanner problem
- Minor-closed class of graphs
- Minus dominating function
- Minus domination number
- Mode
- Mode vertex
- Monadic Second Order formula
- Monge graph
- Monotonicity property
- Mu-Excellent graph
- Multiple domination
- Multiplicity
- Multiplicity of a covering
- Multiplicity of an edge
- Multiway tree
- Mutually eccentric vertices
- Mutually graceful trees
- N-Dominating set
- N-Domination number
- N-Folded Petersen graph
- N-Independence number
- N-Independent set
- N-Iterated line graph
- N-Unavoidable graph
- N-Складной граф Петерсена
- N-Фактор графа
- N-Факторизуемый граф
- NP-Complete language
- NP-Hard language
- NP-Hard problem
- Naked vertex
- Near perfect matching
- Nearest common ancestor
- Nearest common dominator
- Neighbour transition
- Nested set of alts
- Nested set of zones
- Net formula
- Non-edge
- Noncovered vertex
- Nondecidable problem
- Nondeterministic finite automaton
- Nonstrong argument
- Nonstrong input
- Nonstrong output
- Nonstrong result
- Nonterminal alphabet
- Nonterminal symbol
- Normal approximate (point) spectrum
- Normally symmetric graph
- Normed weighted graph
- Null graph
- Number of noncongruence of a numbering
- ODC
- Oberwolfach problem
- Oblique graph
- Obstruction set
- Occurence (of a graph H in G)
- Occurrence process net
- Odd-signable graph
- Odd-signed graph
- One-sided balanced tree
- One-way infinite path
- One-way pushdown automaton
- Open neighbourhood
- Operation
- Operation of a Petri net
- Operation of formation of a set of merged places
- Operation of merging of places
- Operator
- Optimal 1-edge hamiltonian graph
- Optimal 1-hamiltonian graph
- Optimal 1-node hamiltonian graph
- Order of a tree
- Ordered labelled tree
- Ordinary Petri net
- Orientation distance graph
- Orientation number
- Oriented edge
- Orthogonal (g,f)-factorization
- Orthogonal double cover
- Oscillation of a graph
- Out-neighbourhood
- Out-semicomplete digraph
- Out-tree
- Outdegree, out-degree
- Outdegree matrix
- Outpath
- Output dependence
- Output node of fragment
- Output place
- Outset
- P-Competition graph
- P-Critical graph
- P-Language
- P-well-covered graph
- P4-Связный граф
- P=NP problem, P versus NP problem
- PRAM
- P 4-Isomorphic graphs
- P 4-Reduced graph
- P 4-Reducible graph
- P 4-Sparse graph
- P and NP Classes
- Paired-dominating set
- Paired-domination number
- Pan-bicentral graph
- Pan-unicentral graph
- Pancentral graph
- Panpropositionable Hamiltonian graph
- Parikh mapping
- Parse tree
- Partial-edge separator
- Partial graph morphism
- Partial hypergraph
- Partial k-path
- Partial signed domination number
- Partially decidable problem
- Partially ordered set
- Partially square graph
- Partition of a set
- Passive state of compound transition
- Path-Hamiltonian edge
- Path-decomposition
- Path coloring
- Path layer matrix
- Path pile
- Path pile number
- Pathwidth of a graph
- Pebbling number
- Perfect fractional matching
- Perfect graph theorem
- Perfect k-matching
- Perfect one-factorization
- Period
- Periodicity of a graph
- Periphery
- Persistence problem
- Persistent Petri net
- Persistent transition
- Petal of a flower
- Petersen graph
- Petersen hypernet
- Petri graph
- Petri net with place capacities
- Petri net with priorities
- Petri net with waiting
- Pfafian orientation of a graph
- Phrase-structure grammar
- Phylogeny digraph
- Phylogeny graph
- Phylogeny number
- Place
- Planar embedding of a graph
- Planar triangulation
- Planarity criteria
- Point-tree hypergraph
- Point spectrum
- Polar graph
- Polygonal tree
- Polyhedral graph
- Polyhedron graph
- Polynomial algorithm
- Polynomial expression of the stability function
- Polynomial graph inclusion problem
- Polynomial transformation
- Polytop graph
- Pontrjagin-Kuratowski's criterion
- Poset
- Post-condition
- Postdominator tree
- Potential liveness of transitions problem
- Potentially dead transition
- Potentially live transition
- Pre-condition
- Predicate term
- Prefix
- Prefix graph
- Prefix tree
- Prependant vertex
- Prescribed chromatic number
- Prime graph
- Prime hammock
- Prime labeling
- Primitive Petri net
- Primitive cycle
- Primitive net formula
- Print operator
- Priority
- Private neighbor set
- Private neighbour
- Private neighbourhood
- Problem