Wang, Ruixia; Wu, Linxin; Meng, Wei Extremal digraphs on Meyniel-type condition for Hamiltonian cycles in balanced bipartite digraphs. (English) Zbl 1481.05062 Discrete Math. Theor. Comput. Sci. 23, No. 3, Paper No. 8, 12 p. (2021). MSC: 05C20 05C35 05C45 PDFBibTeX XMLCite \textit{R. Wang} et al., Discrete Math. Theor. Comput. Sci. 23, No. 3, Paper No. 8, 12 p. (2021; Zbl 1481.05062) Full Text: DOI arXiv Link
Darbinyan, Samvel Kh. A new sufficient condition for a digraph to be Hamiltonian – a proof of Manoussakis conjecture. (English) Zbl 1462.05156 Discrete Math. Theor. Comput. Sci. 22, No. 4, Paper No. 12, 21 p. (2020). MSC: 05C20 05C45 PDFBibTeX XMLCite \textit{S. Kh. Darbinyan}, Discrete Math. Theor. Comput. Sci. 22, No. 4, Paper No. 12, 21 p. (2020; Zbl 1462.05156) Full Text: DOI arXiv Link
Galeana-Sánchez, Hortensia; Olsen, Mika Solving the kernel perfect problem by (simple) forbidden subdigraphs for digraphs in some families of generalized tournaments and generalized bipartite tournaments. (English) Zbl 1403.05055 Discrete Math. Theor. Comput. Sci. 20, No. 2, Paper No. 16, 13 p. (2018). MSC: 05C20 05C69 05C75 05C45 05C38 PDFBibTeX XMLCite \textit{H. Galeana-Sánchez} and \textit{M. Olsen}, Discrete Math. Theor. Comput. Sci. 20, No. 2, Paper No. 16, 13 p. (2018; Zbl 1403.05055) Full Text: arXiv Link
Highley, Timothy; Le, Hoang Tropical vertex-disjoint cycles of a vertex-colored digraph: barter exchange with multiple items per agent. (English) Zbl 1401.05116 Discrete Math. Theor. Comput. Sci. 20, No. 2, Paper No. 1, 12 p. (2018). MSC: 05C15 05C20 05C38 PDFBibTeX XMLCite \textit{T. Highley} and \textit{H. Le}, Discrete Math. Theor. Comput. Sci. 20, No. 2, Paper No. 1, 12 p. (2018; Zbl 1401.05116) Full Text: arXiv Link
Wang, Ruixia A sufficient condition for a balanced bipartite digraph to be Hamiltonian. (English) Zbl 1401.05177 Discrete Math. Theor. Comput. Sci. 19, No. 3, Paper No. 11, 12 p. (2017). MSC: 05C45 05C20 PDFBibTeX XMLCite \textit{R. Wang}, Discrete Math. Theor. Comput. Sci. 19, No. 3, Paper No. 11, 12 p. (2017; Zbl 1401.05177) Full Text: arXiv Link
Adamus, Janusz; Adamus, Lech; Yeo, Anders On the Meyniel condition for Hamiltonicity in bipartite digraphs. (English) Zbl 1294.05081 Discrete Math. Theor. Comput. Sci. 16, No. 1, 293-302 (2014). MSC: 05C20 05C45 05C38 PDFBibTeX XMLCite \textit{J. Adamus} et al., Discrete Math. Theor. Comput. Sci. 16, No. 1, 293--302 (2014; Zbl 1294.05081) Full Text: arXiv Link
Gruber, Hermann Digraph complexity measures and applications in formal language theory. (English) Zbl 1283.68196 Discrete Math. Theor. Comput. Sci. 14, No. 2, 189-204 (2012). MSC: 68Q45 68Q25 05C20 05C15 05C38 68W25 68Q17 PDFBibTeX XMLCite \textit{H. Gruber}, Discrete Math. Theor. Comput. Sci. 14, No. 2, 189--204 (2012; Zbl 1283.68196) Full Text: arXiv Link
Lladser, Manuel E.; Potocnik, Primoz; Širáň, Jozef; Wilson, Mark C. Random Cayley digraphs of diameter 2 and given degree. (English) Zbl 1283.05251 Discrete Math. Theor. Comput. Sci. 14, No. 2, 83-90 (2012). MSC: 05C80 05C20 05C12 PDFBibTeX XMLCite \textit{M. E. Lladser} et al., Discrete Math. Theor. Comput. Sci. 14, No. 2, 83--90 (2012; Zbl 1283.05251) Full Text: Link