@Article{dbt_mods_00011839,
  author = 	{Harant Prof. Dr. rer. nat. habil., Jochen
		and Rautenbach Prof. Dr. rer. nat. habil., Dieter
		and Regen Dipl.-Math., Friedrich
		and Recht Prof. Dr., Peter},
  title = 	{Packing edge-disjoint cycles in graphs and the cyclomatic number},
  journal = 	{Preprint /  Technische Universit{\"a}t Ilmenau, Institut f{\"u}r Mathematik},
  year = 	{2008},
  month = 	{Dec},
  day = 	{03},
  address = 	{Ilmenau},
  volume = 	{08-25},
  keywords = 	{graph; cycle; packing; cyclomatic number},
  abstract = 	{For a graph G let {\backslash}mu (G) denote the cyclomatic number and let {\backslash}nu (G) denote the maximum number of edge-disjoint cycles of G. We prove that for every k {\backslash}geq 0 there is a nite set P(k) such that every 2-connected graph G for which {\backslash}mu (G) - {\backslash}nu (G) = k arises by applying a simple extension rule to a graph in P(k). Furthermore, we determine P(k) for k {\backslash}leq 2 exactly.},
  url = 	{https://www.db-thueringen.de/receive/dbt_mods_00011839},
  url = 	{http://uri.gbv.de/document/gvk:ppn:625305663},
  url = 	{http://uri.gbv.de/document/gvk:ppn:515104256},
  file = 	{:https://www.db-thueringen.de/servlets/MCRFileNodeServlet/dbt_derivate_00016123/IfM_Preprint_M_08_25.pdf:PDF},
  language = 	{en}
}