Note a Note on Disjoint Dijoins

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


  1. [1]

    P. Feofiloff and D. H. Younger: Directed cut transversal packing for source-sink connected graphs, Combinatorica 7 (1987), 255–263.

    MathSciNet  Article  MATH  Google Scholar 

  2. [2]

    A. Frank: On the orientation of graphs, J. Combinatorial Theory, Ser. B 28 (1980), 251–261.

    MathSciNet  MATH  Google Scholar 

  3. [3]

    J. E. Olson: A combinatorial problem on finite Abelian groups I, J. Number Theory 1 (1969), 8–10.

    MathSciNet  Article  MATH  Google Scholar 

  4. [4]

    J. Plesník: A note on the complexity of finding regular subgraphs, Discrete Mathematics 49 (1984), 161–167.

    MathSciNet  Article  MATH  Google Scholar 

  5. [5]

    A. Schrijver: Min-max relations for directed graphs, Annals of Discrete Math. 16 (1982), 261–280.

    MathSciNet  MATH  Google Scholar 

  6. [6]

    A. Schrijver: Theory of linear and integer programming, Wiley, Chichester, 1986.

    MATH  Google Scholar 

  7. [7]

    D. R. Woodall: Menger and Kőnig systems, Theory and applications of graphs (Proc. Intern. Conf., Western Mich. Univ.), Lecture Notes in Math. 642 (1978), 620–635.

    Article  Google Scholar 

Download references

Author information



Corresponding author

Correspondence to András Mészáros.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Mészáros, A. Note a Note on Disjoint Dijoins. Combinatorica 38, 1485–1488 (2018).

Download citation

Mathematics Subject Classification (2000)

  • 90C27
  • 05C70
  • 11P70