On k-strong and k-cyclic digraphs

Discrete Mathematics

Volumn 162, Issue 1-3, 1996, Pages 1-11

  Bang Jensen, Jørgen ^a   Gutin, Gregory ^a   Yeo, Anders ^a  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040296339     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00300-L     Document Type: Article

References (14)

1. J. Bang-Jensen and G. Gutin, Paths and cycles in extended and decomposable digraphs, Discrete Mathematics, to appear.
2. J. Bang-Jensen and G. Gutin, Finding maximum weight paths and cycles in Φ-decomposable digraphs, using flows in networks, preprint Inst. Math, and CS Odense Univ., no. 51, 1993.
3. J. Bang-Jensen, G. Gutin and J. Huang, A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian, Discrete Mathematics, to appear.
4. J. Bang-Jensen and J. Huang, Quasi-transitive digraphs, J. Graph Theory, 20 (1995) 141-161.
5. J. Bang-Jensen and Y. Manoussakis, Cycles through k vertices and k arcs in bipartite tournaments, Combinatorica 14 (1994) 1-4.
6. J. Bang-Jensen and C. Thomassen, A polynomial algorithm for the 2-path problem for semicomplete digraphs, SIAM J. Discrete Math. 5 (1992) 366-376.
7. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (MacMillan, New York, 1976).
8. L.R. Ford and D.R. Fulkerson, Flows in Networks (Princeton Univ. Press, Princeton, NJ, 1962).
9. G. Gutin, Cycles and paths in semicomplete multipartite digraphs, theorems and algorithms: a survey, J. Graph Theory 19 (1995) 481-505.
10. W. Goddard, G. Kubicki, O. Oellermann and S. Tian, On multipartite tournaments, J. Comb. Theory Ser. B 47 (1991) 284-300.
11. R. Häggkvist and Y. Manoussakis, Cycles and paths in bipartite tournaments with spanning configurations, Combinatorica 9 (1989) 33-38.
12. A.J. Hoffmann, Some recent applications of the theory of linear inequalities to extremal combinatorial analysis, Proc. Symp. Appl. Math. 10 (1960) 113-127.
13. B. Jackson and O. Ordaz, A Chvatal-Erdös condition for (1,1)-factors in digraphs, Discrete Math. 57 (1985) 199-201.
14. C. Thomassen, Highly connected non 2-linked digraphs, Combinatorica 11 (1991) 393-395.