Highly connected non-2-linked digraphs

Abstract

For every natural numberk there exists a stronglyk-connected digraph which contains two vertices through which there is no directed cycle.

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

References

  1. [1]

    J. C. Bermond, andL. Lovász: Problem 3, in:Recent advances in graph theory, Proc. Coll. Prague, Academic Prague (1975), 541.

  2. [2]

    J. C. Bermond, andC. Thomassen: Cycles in digraphs — a survey,J. Graph Theory 5 (1981), 1–43.

    Google Scholar 

  3. [3]

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

    Google Scholar 

  4. [4]

    L. Lovász: Problem, in: Proc. 5th British Conf. 1975,Congressus Numerantium XV. Utilitas Math. Publ. (1976), 696.

  5. [5]

    C. Thomassen: 2-linked graphs,Europ. J. Combinatorics 1 (1980), 371–378.

    Google Scholar 

  6. [6]

    C. Thomassen: Connectivity in tournaments, in:Graph Theory and Combinatorics (B. Bollobás, ed.). Academic Press (1984), 305–313.

  7. [7]

    C. Thomassen: Configurations in graphs of large minimum degree, connectivity or chromatic number, in: Proc. 3rd Internat. Conf. on Combinatorial Mathematics, New York 1985,Ann. of the New York Acad. Sci. Vol.555 (1989), 402–412.

Download references

Author information

Affiliations

Authors

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Thomassen, C. Highly connected non-2-linked digraphs. Combinatorica 11, 393–395 (1991). https://doi.org/10.1007/BF01275674

Download citation

AMS subject classification (1991)

  • 05C20