Advertisement

Combinatorica

, Volume 31, Issue 6, pp 639–668 | Cite as

On the problem of finding disjoint cycles and dicycles in a digraph

  • Jørgen Bang-Jensen
  • Matthias Kriesell
Article

Abstract

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 “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.

Mathematics Subject Classification (2000)

05C38 05C20 05C85 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J. Bang-Jensen and G. Gutin: Digraphs. Theory, algorithms and applications, Second edition, Springer Monographs in Mathematics, Springer-Verlag London, Ltd., London (2009).Google Scholar
  2. [2]
    J. Bang-Jensen and M. Kriesell: Disjoint directed and undirected paths and cycles in digraphs, Theoret. Comput. Sci. 46–49 (2009), 5138–5144.MathSciNetCrossRefGoogle Scholar
  3. [3]
    G. A. Dirac: Some results concerning the structure of graphs, Canad. Math. Bull. 6 (1963), 183–210.MathSciNetzbMATHCrossRefGoogle Scholar
  4. [4]
    S. Fortune, J. Hopcroft and J. Wyllie: The directed subgraph homeomorphism problem, Theoret. Comput. Sci. 10 (1980), 111–121.MathSciNetzbMATHCrossRefGoogle Scholar
  5. [5]
    L. Lovász: On graphs not containing independent circuits (in Hungarian), Mat. Lapok 16 (1965), 289–299.MathSciNetzbMATHGoogle Scholar
  6. [6]
    W. McCuaig: Intercyclic digraphs, Graph structure theory (Seattle, WA, 1991), Contemp. Math. 147, Amer. Math. Soc., Providence, RI (1993), 203–245.Google Scholar
  7. [7]
    A. Metzlar: Minimum transversal of cycles in intercyclic digraphs, PhD thesis, University of Waterloo, Ontario, Canada (1989).Google Scholar
  8. [8]
    A. Metzlar: Disjoint paths in acyclic digraphs, J. Combin. Theory B 57 (1993), 228–238.MathSciNetzbMATHCrossRefGoogle Scholar
  9. [9]
    C. Thomassen: Disjoint cycles in digraphs, Combinatorica 3 (1983), 393–396.MathSciNetzbMATHCrossRefGoogle Scholar
  10. [10]
    C. Thomassen: The 2-linkage problem for acyclic digraphs, Discrete Math. 55 (1985), 73–87.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© János Bolyai Mathematical Society and Springer Verlag 2011

Authors and Affiliations

  1. 1.IMADAUniversity of Southern DenmarkOdense MDenmark

Personalised recommendations