Abstract
It is shown that if an oriented complete bipartite graph has a directed cycle of length 2 n, then it has directed cycles of all smaller even lengths unless n is even and the 2 n-cycle induces one special digraph.
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
