A degree condition for cycles of maximum length in bipartite digraphs
Combinatorics
2012-01-04 v2
Abstract
We prove a sharp Ore-type criterion for hamiltonicity of balanced bipartite digraphs: A bipartite digraph D, with colour classes of cardinality N, is hamiltonian if, for every pair of vertices u and v from opposite colour classes of D such that the arc uv is not in D, the sum of the outdegree of u and the indegree of v is greater than or equal to N+2.
Cite
@article{arxiv.1101.4973,
title = {A degree condition for cycles of maximum length in bipartite digraphs},
author = {Janusz Adamus and Lech Adamus},
journal= {arXiv preprint arXiv:1101.4973},
year = {2012}
}
Comments
8 pages, minor exposition changes