TR-2009-07

Constructive Characterization Theorems in Combinatorial Optimization

Erika Renáta Bérczi-Kovács, László Végh

Published in:
RIMS Kôkyuroku Bessatsu, B23:147-169, 2010

We give a survey on constructive characterization theorems and their applications in various fields of combinatorial optimization: edge- and vertex-connectivity problems, ear decompositions, and rigidity of graphs.

Bibtex entry:

@techreport{egres-09-07,

AUTHOR	=	{B{\'e}rczi-Kov{\'a}cs Ren{\'a}ta, Erika and V{\'e}gh, L{\'a}szl{\'o}},
TITLE	=	{Constructive Characterization Theorems in Combinatorial Optimization},
NOTE	=	{{\tt egres.elte.hu}},
INSTITUTION	=	{Egerv{\'a}ry Research Group, Budapest},
YEAR	=	{2009},
NUMBER	=	{TR-2009-07}

}