, Volume 38, Issue 6, pp 1485–1488 | Cite as

Note a Note on Disjoint Dijoins

  • András MészárosEmail author
Original paper

Mathematics Subject Classification (2000)

90C27 05C70 11P70 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    P. Feofiloff and D. H. Younger: Directed cut transversal packing for source-sink connected graphs, Combinatorica 7 (1987), 255–263.MathSciNetCrossRefzbMATHGoogle Scholar
  2. [2]
    A. Frank: On the orientation of graphs, J. Combinatorial Theory, Ser. B 28 (1980), 251–261.MathSciNetzbMATHGoogle Scholar
  3. [3]
    J. E. Olson: A combinatorial problem on finite Abelian groups I, J. Number Theory 1 (1969), 8–10.MathSciNetCrossRefzbMATHGoogle Scholar
  4. [4]
    J. Plesník: A note on the complexity of finding regular subgraphs, Discrete Mathematics 49 (1984), 161–167.MathSciNetCrossRefzbMATHGoogle Scholar
  5. [5]
    A. Schrijver: Min-max relations for directed graphs, Annals of Discrete Math. 16 (1982), 261–280.MathSciNetzbMATHGoogle Scholar
  6. [6]
    A. Schrijver: Theory of linear and integer programming, Wiley, Chichester, 1986.zbMATHGoogle 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.CrossRefGoogle Scholar

Copyright information

© János Bolyai Mathematical Society and Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Central European UniversityBudapestHungary

Personalised recommendations