Next:
GT1 MINIMUM VERTEX
Up:
Graph Theory
Previous:
Graph Theory
Covering and Partitioning
GT1 M
INIMUM
V
ERTEX
C
OVER
GT2 M
INIMUM
D
OMINATING
S
ET
GT3 M
INIMUM
E
DGE
D
OMINATING
S
ET
GT4 M
INIMUM
I
NDEPENDENT
D
OMINATING
S
ET
GT5 M
INIMUM
G
RAPH
C
OLORING
GT6 M
AXIMUM
A
CHROMATIC
N
UMBER
GT7 M
INIMUM
E
DGE
C
OLORING
GT8 M
INIMUM
F
EEDBACK
V
ERTEX
S
ET
GT9 M
INIMUM
F
EEDBACK
A
RC
S
ET
GT10 M
AXIMUM
T
RIANGLE
P
ACKING
GT11 M
AXIMUM
H-M
ATCHING
GT12 M
INIMUM
B
OTTLENECK
P
ATH
M
ATCHING
GT13 M
INIMUM
C
LIQUE
P
ARTITION
GT14 M
INIMUM
K
-C
APACITATED
T
REE
P
ARTITION
GT15 M
INIMUM
C
LIQUE
C
OVER
GT16 M
INIMUM
C
OMPLETE
B
IPARTITE
S
UBGRAPH
C
OVER
GT17 M
INIMUM
V
ERTEX
D
ISJOINT
C
YCLE
C
OVER
GT18 M
INIMUM
E
DGE
D
ISJOINT
C
YCLE
C
OVER
GT19 M
INIMUM
C
UT
C
OVER
Viggo Kann
Mon Apr 21 13:07:14 MET DST 1997