Applications of Eulerian splitting-off

Tamás Király


The aim of the present paper is to show how a slight generalization of a splitting-off result of Berstimas and Teo offers a common understanding of several seemingly unrelated results in graph connectivity theory.

Bibtex entry:

AUTHOR = {Kir{\'a}ly, Tam{\'a}s},
TITLE = {Applications of Eulerian splitting-off},
NOTE= {{\tt}},
INSTITUTION = {Egerv{\'a}ry Research Group, Budapest},
YEAR = {2007},
NUMBER = {TR-2007-01}

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