Некатегоризованные страницы
Материал из WikiGrapp
Ниже показано до 250 результатов в диапазоне от 1051 до 1300.
- 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
