On the Meyniel condition for hamiltonicity in bipartite digraphs
暂无分享,去创建一个
[1] A. Bonato,et al. Graphs and Hypergraphs , 2022 .
[2] Jean-Claude Bermond,et al. Cycles in digraphs- a survey , 1981, J. Graph Theory.
[3] Gregory Gutin,et al. Digraphs - theory, algorithms and applications , 2002 .
[4] Carsten Thomassen,et al. A short proof of Meyniel's theorem , 1977, Discret. Math..
[5] Yannis Manoussakis,et al. A sufficient condition for maximum cycles in bipartite digraphs , 1999, Discret. Math..
[6] Lech Adamus,et al. A degree condition for cycles of maximum length in bipartite digraphs , 2012, Discret. Math..
[7] S. F. Kapoor,et al. The Many Facets of Graph Theory , 1969 .
[8] M. Meyniel. Une condition suffisante d'existence d'un circuit hamiltonien dans un graphe oriente , 1973 .
[9] Yannis Manoussakis,et al. Cycles and paths of many lengths in bipartite digraphs , 1990, J. Comb. Theory, Ser. B.
[10] D. R. Woodall. Sufficient Conditions for Circuits in Graphs , 1972 .