One-Diregular Subgraphs in Semicomplete Multipartite Digraphs

Journal of Graph Theory

Volumn 24, Issue 2, 1997, Pages 175-185

  Yeo, Anders ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031538741     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199702)24:2<175::AID-JGT5>3.0.CO;2-N     Document Type: Article

References (11)

1. J. Bang-Jensen, G. Gutin, and A. Yeo, On k-strong and k-cyclic digraphs, Discrete Math. to appear.
2. J. Bang-Jensen and Y. Manoussakis, Cycles through k vertices in bipartite tournaments, Combinatorica 14 (1994), 243-246.
3. J. Bang-Jensen, G. Gutin, and J. Huang, A sufficient condition for a complete multipartite digraph to be hamiltonian, Discrete Math. to appear.
4. J. Bang-Jensen, G. Gutin, and H. Li, Sufficient conditions for a digraph to be hamiltonian, J. Graph Theory 22 181-187 (1996).
5. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, MacMillan Press, New York (1976).
6. G. Gutin, Cycles and paths in semicomplete multipartite digraphs, theorems and algorithms: A survey, J. Graph Theory 19 (1995), 481-505.
7. G. Gutin, Paths and Cycles in Directed Graphs. Ph.D. thesis, Tel Aviv (1993).
8. A. J. Hoffmann, Some recent applications of the theory of linear inequalities to extremal combinatorial analysis, Proc. Symp. Appl. Math. 10 (1960), 113-127.
9. O. Ore, Theory of Graphs, AMS Colloquium Publications 38, AMS, Providence (1962).
10. L. Volkmann, a talk at The Second Krakow Conference of Graph Theory (1994).
11. C.-Q. Zhang, Hamilton paths in multipartite oriented graphs. Ann. Discrete Math. 41 (1989), 499-514.