Szerkesztő:LinguisticMystic/index

Hamiltonian graph
Hungarian method
NP complete problem
Petersen graph
Skolem hull
Turing machine
Turán graph
adjacency matrix of a graph
adjacent vertices
alphabet
ancestor of a vertex
arbitrary graph
arc of a graph
axioms of independence
base matroid
base of a matroid
basic function
basic operator
bicenter of a tree
big oh notation
bin packing problem
bin packing
bipartite graph
capacity of a cut
capacity of an edge
cardinality of sets
center of a tree
characteristic function of a language
characteristic function of a set
characteristic function
characteristic
child of a vertex in a rooted tree
child of a vertex
chromatic number of a graph
circle graph
circle in a graph
circle matrix of a graph
circle
circuit of a matroid
cofactor matrix of a matrix
cofactor of a matrix
coloring number of a graph
coloring of a vertex
coloring of edges of graphs
coloring of edges
coloring of vertices of graphs
coloring of vertices
coloring
complement graph
complement of a set
complete bipartite graph
complete graph
complete multipartite graph
component of a graph
composition operator
conjuction
connected vertices
consistent axiom system
constant function
correcting path
crossing number of a graph
cubic graph
cut matrix of a graph
cycle of a matroid
deducing rules
degree matrix of a graph
degree of a vertex
derangement
descendant of a vertex
deterministic Turing machine
diameter of a graph
digraph
directed edge
directed graph
disjunction
distance of vertices
edge coloring
edge graph
edge incident on a vertex
edge multiplicity
edge of a graph
edge preserving mapping
edge-connected vertices
empty set
empty word
entier
eventually periodic sequence
feasible flow
forest graph
forest
free matroid
generalized combination
generalized permutation
generalized variation
girth of a graph
graph of a graph
graph circle
graph coloring
graph complement
graph isomorphism
graph loop
graph node
graph vertex
graphic matroid
greedoid
greedy algorithm
ground set
halting problem
handshaking theorem
hatcheck problem
head of a Turing machine
height of a rooted tree
hyperedge
hypergraph
incidence matrix of a graph
incident edge on vertex
incident vertex on edge
incident vertices
independence axioms in matroids
infinite graph
inner states Turing machine
inner states of a Turing machine
integer linear programing
intersection of sets
interval coloring
isolated vertex
isomorphic graph
isomorphic graphs
isomorphic mapping
isomorphic
isomorphism between graphs
isomorphism of graphs
isomorphism
leaf vertex
lenght of a circle
lenght of a path
length of a circle
length of a path
levels of a graph
loop of a graph
loop of a matroid
matching matroid
matching
matric matroid
matroid matching
matroid partition
moving direction of a head in a Turing machine
moving direction of a head of a Turing machine
multigraph
multipartite graph
multiple edge
n over k
neighbors of a vertex-set
neighbors of a vertex
node of a graph
nonpolynomial complete problems primitive recursion
nonpolynomial complete problems
nonpolynomial
nonterminal symbol
operator
outer alphabet of a Turing machine
outerplanar graph
parallel elements of a matroid
partial recursive set
partial recursive
partial recursively enumerable
partial set
partition matroid
partition
path graph
path in a graph
path of a graph
perfect matching
permutation
planar graph
pole of a graph
polynomial
power set
primitive recursion operator
primitive recursive enumerable
primitive recursive set
primitive recursive
primitive set
principle of inclusion and exclusion
projection function
pseudograph
rank of a matroid
rank of a subset
recursive enumerable partial
recursive enumerable primitive
recursive language
recursive partial
recursive primitive
recursive set
recursive
recursively enumerable set
recursively enumerable
reduced incidence matrix of a graph
regular graph
root of a graph
rooted tree binary
rooted tree strict isomorphism
rooted tree
rooting of a graph
rooting
run of a nondeterministic Turing machine
semi-Hamiltonian graph
semi-Hamiltonian graph
sequence eventually periodic
set of nonpolynomial problems
set of polynomial problems
set system
simple circle
simple edge
simple graph
simple path
solution of a problem by a nondeterministic Turing machine
sorting of data
source
spanned subgraph
spanning tree
spectra of graph
spectrum of a graph
star graph
starting symbol
strict isomorphism of trees
subdivision of an edge
subgraph
subset
successor function
symbol nonterminal
symbol starting
symbol terminal
trace of a matrix
transferring function of a Turing machine
traveling salesman problem
tree graph
type of a structure
uniform matroid
union of sets
value of a flow
vertex incident on an edge
vertex leaf
vertex of a graph
vertex-coloring
vertices neighbors
vertices of a graph
weight function
weight of a circle
weight of a path
weighted distance of vertices
well coloring of a vertex
well coloring of vertices
width of a graph
windmill graph