A sufficient condition for maximum cycles in bipartite digraphs

DOI10.1016/S0012-365X(98)00352-5zbMath0939.05044MaRDI QIDQ1817571

Yannis Manoussakis, Ioannis Milis

Publication date: 2 March 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

cycledigraphdirected bipartite graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Extremal digraphs on Woodall‐type condition for Hamiltonian cycles in balanced bipartite digraphs ⋮ A degree condition for cycles of maximum length in bipartite digraphs ⋮ Sufficient conditions for Hamiltonian cycles in bipartite digraphs

This page was built for publication: A sufficient condition for maximum cycles in bipartite digraphs