\input zb-basic
\input zb-ioport
\iteman{io-port 06030948}
\itemau{Kotrb\v{c}{\'\i}k, Michal}
\itemti{A note on disjoint cycles.}
\itemso{Inf. Process. Lett. 112, No. 4, 135-137 (2012).}
\itemab
Summary: We prove tight polynomial-time computable lower and upper bounds on the maximum number of vertex-disjoint cycles of a given graph in terms of its cycle rank and maximum genus.
\itemrv{~}
\itemcc{}
\itemut{combinatorial problems; vertex-disjoint cycles; maximum genus}
\itemli{doi:10.1016/j.ipl.2011.11.006}
\end