Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference8 articles.
1. Adamus, J.: A degree sum condition for hamiltonicity in balanced bipartite digraphs. Graphs Combin. 33, 43–51 (2017)
2. Adamus, J., Adamus, L., Yeo, A.: On the Meyniel condition for hamiltonicity in bipartite digraphs. Discrete Math. Theor. Comput. Sci. 16, 293–302 (2014)
3. Bang-Jensen, J., Guo, Y., Yeo, A.: A new sufficient condition for a digraph to be Hamiltonian. Discrete 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
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献