Publisher
Springer International Publishing
Reference80 articles.
1. D. Amar and Y. Manoussakis. Cycles and paths of many lengths in bipartite digraphs. J. Combin. Theory Ser. B, 50(2):254–264, 1990.
2. J. Bang-Jensen and G. Gutin. Digraphs: Theory, Algorithms and Applications. Springer-Verlag, London, 2nd edition, 2009.
3. J. Bang-Jensen and G. Gutin. On the complexity of hamiltonian path and cycle problems in certain classes of digraphs. Discrete Appl. Math., 95:41–60, 1999.
4. J. Bang-Jensen, G. Gutin, and J. Huang. A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian. Discrete Math., 161(1-3):1–12, 1996.
5. J. Bang-Jensen, G. Gutin, and J. Huang. Weakly Hamiltonian-connected ordinary multipartite tournaments. Discrete Math., 138(1-3):63–74, 1995.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献