Funder
Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference6 articles.
1. Adamus, J., Adamus, L., Yeo, A.: On the Meyniel condition for hamiltonicity in bipartite digraphs. Discret. Math. Theor. Comput. Sci. 16, 293–302 (2014)
2. Amar, D., Manoussakis, Y.: Cycles and paths of many lengths in bipartite digraphs. J. Combin. Theory Ser. B 50, 254–264 (1990)
3. Bang-Jensen, J., Guo, Y., Yeo, A.: A new sufficient condition for a digraph to be Hamiltonian. Discret. Appl. Math. 95, 61–72 (1999)
4. Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, 2nd edn. Springer, London (2009)
5. Bang-Jensen, J., Gutin, G., Li, H.: Sufficient conditions for a digraph to be Hamiltonian. J. Graph Theory 22, 181–187 (1996)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献