Directed circuits on a torus

Abstract

Given verticess, t of a planar digraphG, does there exist a directed circuit ofG containing boths andt? We give a polynomial algorithm for this and for a number of related problems, including one about disjoint directed circuits of prescribed homotopy in a digraph drawn on a torus.

This is a preview of subscription content, access via your institution.

References

  1. [1]

    L. R. Ford: Network flow theory, Rand Corporation Report (1956), 923.

  2. [2]

    S. Fortune, J. E. Hopcroft, andJ. Wyllie: The directed subgraph homeomorphism problem,J. Theoret. Comp. Sci. 10 (1980), 111–121.

    Google Scholar 

  3. [3]

    Neil Robertson, andP. D. Seymour: Graph minors. VI. Disjoint paths across a disc.,J. Combinatorial Theory, Ser. B.,41 (1986), 115–138.

    Google Scholar 

Download references

Author information

Affiliations

Authors

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Seymour, P.D. Directed circuits on a torus. Combinatorica 11, 261–273 (1991). https://doi.org/10.1007/BF01205078

Download citation

AMS subject classification (1980)

  • 05 C 70
  • 05 C 10
  • 05 C 20
  • 05 C 38