Constructive Characterization Theorems in Combinatorial Optimization

Erika 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:

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

Last modification: 5.6.2018. Please email your comments to Tamás Király!