On Hamiltonian Cycles in a 2-Strong Digraphs with Large Degrees and Cycles
-
Published:2024-03
Issue:1
Volume:34
Page:62-73
-
ISSN:1054-6618
-
Container-title:Pattern Recognition and Image Analysis
-
language:en
-
Short-container-title:Pattern Recognit. Image Anal.
Publisher
Pleiades Publishing Ltd
Reference31 articles.
1. J. Adamus, “A degree sum condition for hamiltonicity in balanced bipartite digraphs,” Graphs Combinatorics 33, 43–51 (2017). https://doi.org/10.1007/s00373-016-1751-6
2. J. Adamus, “On dominating pair for Hamiltonicity in balanced bipartite digraphs,” Discrete Math. 344, 112240 (2021).
3. J. Adamus and L. Adamus, “A degree condition for cycles of maximum length in bipartite digraphs,” Discrete Math. 312, 1117–1122 (2012). https://doi.org/10.1016/j.disc.2011.11.032
4. J. Adamus, L. Adamus, and A. Yeo, “On the Meyniel condition for hamiltonicity in bipartite digraphs,” Discrete Math. Theor. Comput. Sci. 16, 293–302 (2014). https://doi.org/10.46298/dmtcs.1264
5. J. Bang-Jensen and G. Z. Gutin, Digraphs: Theory, Algorithms and Applications, Springer Monographs in Mathematics (Springer, 2000). https://doi.org/10.1007/978-1-84800-998-1