论文信息 - A degree condition for cycles of maximum length in bipartite digraphs

A degree condition for cycles of maximum length in bipartite digraphs

We prove a sharp Ore-type criterion for hamiltonicity of balanced bipartite digraphs: for a>=2, a bipartite digraph D with colour classes of cardinalities a is hamiltonian if d^+(u)+d^-(v)>=a+2 whenever u and v lie in opposite colour classes and [email protected]?A(D).

Lech Adamus | Janusz Adamus

[1] Jean-Claude Bermond,et al. Cycles in digraphs- a survey , 1981, J. Graph Theory.

[2] M. Meyniel. Une condition suffisante d'existence d'un circuit hamiltonien dans un graphe oriente , 1973 .

[3] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.

[4] Yannis Manoussakis,et al. Cycles and paths of many lengths in bipartite digraphs , 1990, J. Comb. Theory, Ser. B.

[5] D. R. Woodall. Sufficient Conditions for Circuits in Graphs , 1972 .

[6] Yannis Manoussakis,et al. A sufficient condition for maximum cycles in bipartite digraphs , 1999, Discret. Math..

[7] Carsten Thomassen,et al. A short proof of Meyniel's theorem , 1977, Discret. Math..

[8] C. Nash-Williams,et al. Hamiltonian circuits in graphs and digraphs , 1969 .