<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">44535853X</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180317142908.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170323e20111201xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s00493-011-2670-z</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s00493-011-2670-z</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">On the problem of finding disjoint cycles and dicycles in a digraph</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Jørgen Bang-Jensen, Matthias Kriesell]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">We study the following problem: Given a digraph D, decide if there is a cycle B in D and a cycle C in its underlying undirected graph UG(D) such that V (B)∩V (C)=ø. Whereas the problem is NP-complete if, as additional part of the input, a vertex x is prescribed to be contained in C, we prove that one can decide the existence of B,C in polynomial time under the (mild) additional assumption that D is strongly connected. Our methods actually find B,C in polynomial time if they exist. The behaviour of the problem as well as our solution depend on the cycle transversal number τ (D) of D, i.e. the smallest cardinality of a set T of vertices in D such that D-T is acyclic: If τ (D)≥3 then we employ McCuaig's framework on intercyclic digraphs to (always) find these cycles. If τ (D) = 2 then we can characterize the digraphs for which the answer is &quot;yes” by using topological methods relying on Thomassen's theorem on 2-linkages in acyclic digraphs. For the case τ (D)≤1 we provide an algorithm independent from any earlier work.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">János Bolyai Mathematical Society and Springer Verlag, 2011</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Bang-Jensen</subfield>
   <subfield code="D">Jørgen</subfield>
   <subfield code="u">IMADA, University of Southern Denmark, DK-5230, Odense M, Denmark</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Kriesell</subfield>
   <subfield code="D">Matthias</subfield>
   <subfield code="u">IMADA, University of Southern Denmark, DK-5230, Odense M, Denmark</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Combinatorica</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">31/6(2011-12-01), 639-668</subfield>
   <subfield code="x">0209-9683</subfield>
   <subfield code="q">31:6&lt;639</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">31</subfield>
   <subfield code="o">493</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s00493-011-2670-z</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s00493-011-2670-z</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Bang-Jensen</subfield>
   <subfield code="D">Jørgen</subfield>
   <subfield code="u">IMADA, University of Southern Denmark, DK-5230, Odense M, Denmark</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Kriesell</subfield>
   <subfield code="D">Matthias</subfield>
   <subfield code="u">IMADA, University of Southern Denmark, DK-5230, Odense M, Denmark</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Combinatorica</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">31/6(2011-12-01), 639-668</subfield>
   <subfield code="x">0209-9683</subfield>
   <subfield code="q">31:6&lt;639</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">31</subfield>
   <subfield code="o">493</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
