Abstract
We give several sufficient conditions on the half-degrees of a bipartite digraph for the existence of cycles and paths of various lengths. Some analogous results are obtained for bipartite oriented graphs and for bipartite tournaments.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
