Некатегоризованные страницы
Материал из WikiGrapp
Ниже показано до 250 результатов в диапазоне от 291 до 540.
- Bull
- Butterfly graph
- C-Chordal graph
- CF-Language
- CF-grammar
- CKI-орграф
- CPM
- CS-Grammar
- CS-language
- Cactus
- Cage number
- Call graph
- Capacity of a cut-set
- Capacity of an arc
- Cardinal product
- Cardinality constrained circuit problem
- Cartesian product of graphs
- Cartesian sum of graphs
- Case term
- Categorical product of graphs
- Caterpillar
- Caterpillar-pure graph
- Cayley graph
- Center
- Center of gravity of a graph
- Center vertex
- Central distance
- Central fringe
- Central vertex
- Centroid
- Centroid sequence
- Centroid vertex
- Centroidal vertex
- Cf-Graph
- Chain
- Chain graph
- Characteristic number of a graph
- Characteristic polynomial of Laplacian
- Characteristic polynomial of a graph
- Chinese postman's problem
- Choice number
- Chomsky hierarchy
- Chomsky normal form
- Choosability
- Chord
- Chordal bipartite graph
- Chordal graph
- Chordless cycle
- Chromatic decomposition of a graph
- Chromatic distance
- Chromatic function
- Chromatic index
- Chromatic number
- Chromatic polynomial
- Chromatic status
- Chromatically equivalent graphs
- Chromatically unique graph
- Church's thesis
- Circuit
- Circuit closed graph
- Circuit edge connected vertices
- Circuit isomorphic graphs
- Circuit of matroid
- Circuit rank
- Circuitless graph
- Circulant graph
- Circular-arc graph
- Circular chromatic number
- Circular clique number
- Circular coloring of a graph
- Circular perfect graph
- Circumference of a graph
- Circumstance
- Circumstance problem
- Classification of Binary Trees
- Claw
- Claw-free graph
- Clique
- Clique-good graph
- Clique-independence number
- Clique-independent set
- Clique-partition
- Clique-perfect graph
- Clique-transversal
- Clique-transversal number
- Clique-width
- Clique convergent
- Clique cover
- Clique cover number, clique-covering number
- Clique divergent
- Clique graph
- Clique matrix
- Clique model
- Clique number
- Clique polynomial
- Clique problem
- Clique separator
- Clique size
- Clique tree
- Closed hamiltonian neighbourhood
- Closed neighbourhood
- Closed semiring
- Closed walk
- Closure of graph
- Cluster
- Clustered graph
- Clutter
- Coadjoint graphs
- Coadjoint pair
- Coalescing of two rooted graphs
- Coarseness
- Cobase of a matroid
- Coboundary of a graph
- Coboundary operator
- Cochromatic number
- Cocircuit of a graph
- Cocircuit of a matroid
- Cocomparability graph
- Cocomparability number
- Cocomparability ordering
- Cocycle
- Cocycle basis
- Cocycle vector
- Cocyclic matrix
- Cocyclic rank of a graph
- Code of a tree
- Codependent set of a matroid
- Codiameter
- Codistance
- Cograph
- Cographic matroid
- Coindependent set of a matroid
- Color graph of a group
- Color requirement of a vertex
- Coloration
- Colored distance
- Colored graph
- Colored multigraph
- Coloring, colouring
- Coloring number
- Coloured Petri net
- Coloured class
- Combinatorial Laplacian
- Combinatorial dual graph, combinatorically dual graph
- Comet
- Common ancestor
- Common minimal dominating graph
- Common receiver
- Common server
- Compact
- Compact closed class of graphs
- Comparability graph
- Comparable vertices
- Competition-common enemy graph
- Competition graph (of a tournament)
- Competition number
- Compilation problem
- Complement-reducible graph
- Complement of a graph, complementary graph
- Complete bipartite graph
- Complete coloring
- Complete colouring
- Complete directed graph
- Complete graph
- Complete homomorphism of order n
- Complete k-partite graph
- Complete k-uniform hypergraph
- Complete multipartite graph
- Complete product
- Complete rotation
- Complete set of graph invariants
- Complete system of equivalent transformations
- Complete tree
- Completed Husimi tree
- Completely triangular graph
- Complex windmill
- Complexity of RAM
- Complexity theory
- Component design method
- Component index
- Component number
- Component of a graph
- Composite hammock
- Composition of graphs
- Compound dependency graph
- Compound graph
- Computation
- Concatenation
- Concatenation closure
- Concepts Path Graph
- Conceptual graph
- Condensation
- Conditional connectivity
- Cone over a graph
- Conflict
- Confluent NCE graph grammar
- Conformal hypergraph
- Conjunction of graphs
- Connected component
- Connected component of a hypergraph
- Connected dominating set
- Connected domination number
- Connected graph
- Connected hierarchical graph
- Connected hypergraph
- Connected set of vertices
- Connected to relation
- Connected vertices
- Connective index
- Connectivity
- Connectivity axioms
- Connectivity function
- Connectivity matrix
- Consecutive adjacent graph
- Consecutive labeling
- Constructible graph
- Constructing enumeration
- Constructing order
- Containment graph
- Context-free grammar
- Context-free language
- Context-sensitive grammar
- Context-sensitive language
- Contrabasis
- Contractable edge
- Contracted visibility graph
- Contracting edge, contraction of an edge
- Contraction of a graph
- Contraction of an even pair
- Contrafunctional graph
- Control dependence
- Converse digraph
- Convex bipartite graph
- Convex dominating set
- Convex domination number
- Convex linear graph
- Convex set in G
- Coordinated graph
- Corank function of a matroid
- Core
- Corona
- Cospectral graphs
- Cotree, co-tree
- Countable graph
- Counter automation
- Coverability tree
- Covering cycle
- Covering graph
- Covering set of vertices
- Covering vertex set
