QP-2006-04

A note on making two bipartite graphs perfectly matchable

Júlia Pap

Bibtex entry:

@techreport{egresqp-06-04,

AUTHOR	=	{Pap, J{\'u}lia},
TITLE	=	{A note on making two bipartite graphs perfectly matchable},
NOTE	=	{{\tt egres.elte.hu}},
INSTITUTION	=	{Egerv{\'a}ry Research Group, Budapest},
YEAR	=	{2006},
NUMBER	=	{QP-2006-04}

}