Некатегоризованные страницы
Материал из WikiGrapp
Ниже показано до 250 результатов в диапазоне от 1751 до 2000.
- Number of noncongruence of a numbering
- Numbering
- Numbering of cf-graph
- ODC
- Oberwolfach problem
- Oblique graph
- Obstruction set
- Occurence (of a graph H in G)
- Occurrence process net
- Odd-signable graph
- Odd-signed graph
- Odd component
- Odd component number
- Odd graph
- One-chromatic number
- One-sided balanced tree
- One-way infinite path
- One-way infinite sequence
- One-way pushdown automaton
- Open neighbourhood
- Open sequence
- 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
- Optimal numbering
- Optimal ordering for trees
- Order of a graph
- Order of a hypergraph
- Order of a tree
- Order of an automorphism group
- Order relation
- Ordered chromatic number
- Ordered coloring of vertices
- Ordered edge chromatic number
- Ordered graph
- Ordered labelled tree
- Ordered tree
- Ordinary Petri net
- Orientation distance graph
- Orientation number
- Orientation of a graph
- Oriented edge
- Oriented graph
- Oriented tree
- Orthogonal (g,f)-factorization
- Orthogonal double cover
- Oscillation of a graph
- Out-neighbourhood
- Out-semicomplete digraph
- Out-tree
- Outcenter
- Outcoming arc
- Outdegree, out-degree
- Outdegree matrix
- Outerplanar graph
- Outerplane graph
- Outpath
- Output
- Output dependence
- Output directed spanning tree
- Output node of fragment
- Output place
- Output tree
- Output vertex of subgraph
- Outradius
- Outseparation number
- Outset
- P-Center
- P-Competition graph
- P-Critical graph
- P-Language
- P-Radius
- P-well-covered graph
- P-Центр
- P4-Connected graph
- P4-Связный граф
- P=NP problem, P versus NP problem
- PRAM
- PSPACE-hard problem
- P 4-Isomorphic graphs
- P 4-Reduced graph
- P 4-Reducible graph
- P 4-Sparse graph
- P and NP Classes
- Pack of a graph
- Packing of graphs
- Pair of connectivities
- Paired-dominating set
- Paired-domination number
- Pan-bicentral graph
- Pan-unicentral graph
- Pancentral graph
- Pancyclic graph
- Panpropositionable Hamiltonian graph
- Parallel Random Access Machine (PRAM)
- Parikh mapping
- Parse tree
- Partial-edge separator
- Partial edge
- Partial graph morphism
- Partial hypergraph
- Partial k-path
- Partial k-tree
- Partial order relation
- Partial signed domination number
- Partially decidable problem
- Partially ordered set
- Partially square graph
- Partition of a graph
- Partition of a set
- Partitioning problem
- Passive state of compound transition
- Path
- Path-Hamiltonian edge
- Path-decomposition
- Path coloring
- Path covering
- Path layer matrix
- Path pile
- Path pile number
- Pathwidth of a graph
- Pebbling number
- Pendant edge
- Peninsula
- Perfect elimination graph
- Perfect elimination scheme
- Perfect fractional matching
- Perfect graph
- Perfect graph theorem
- Perfect k-matching
- Perfect matching
- Perfect one-factorization
- Perfect sequence
- Perfectly contractile graph
- Period
- Periodicity of a graph
- Peripheral vertex
- Periphery
- Permutation graph
- 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 graph
- Planar matroid
- Planar tree
- Planar triangulation
- Planarity criteria
- Plane graph
- Plane map
- Plane numbering
- Plane triangulation
- Plex
- Point
- Point-covering number
- Point-tree hypergraph
- Point spectrum
- Polar graph
- Pole
- 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
- Position tree
- Post-condition
- Postdomination
- Postdominator
- Postdominator tree
- Potential liveness of transitions problem
- Potentially dead transition
- Potentially live transition
- Power-chordal graph
- Pre-condition
- Predecessor of a vertex
- Predicate term
- Prefix
- Prefix graph
- Prefix graph of width n
- Prefix language
- Prefix tree
- Preorder
- Prependant vertex
- Prescribed chromatic number
- Prime graph
- Prime hammock
- Prime labeling
- Primitive Petri net
- Primitive cycle
- Primitive directed graph
- Primitive net formula
- Print operator
- Priority
- Prism
- Private neighbor set
- Private neighbour
- Private neighbourhood
- Problem
- Problem of finite-state automaton minimization
- Problem size
- Process
- Process net
- Process net with competition
- Product of graphs
- Product of two languages
- Production
- Production grammar
- Profile numbering
- Profile of a graph
- Profile of numbering
- Profile width of a vertex
- Program
- Program dependence graph
- Program dependences
- Program equivalence
- Program of automaton
- Program optimization
- Program schemata
- Progressive bounded graph
- Progressive finite graph
- Proper (vertex) colouring
- Proper coloring
- Proper control flow graph
- Proper dominator
- Proper interval graph
- Proper labeling
- Proper matching
