A sufficient condition for maximum cycles in bipartite digraphs

DOI10.1016/S0012-365X(98)00352-5zbMATH Open0939.05044MaRDI QIDQ1817571FDOQ1817571

Authors: Y. Manoussakis, Ioannis Milis 

Publication date: 2 March 2000

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

Recommendations

• Publication:3487412
• Cycles and paths of many lengths in bipartite digraphs
• A note on cycles of maximum length in bipartite digraphs
• A degree condition for cycles of maximum length in bipartite digraphs
• Long cycles in bipartite tournaments

zbMATH Keywords

cycledigraphdirected bipartite graph

Mathematics Subject Classification ID

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

Cited In (9)

• A degree condition for cycles of maximum length in bipartite digraphs
• Cycles and paths of many lengths in bipartite digraphs
• Sufficient conditions for Hamiltonian cycles in bipartite digraphs
• An optimal binding number condition for bipancyclism
• Turán-type problem for a cycle of length \(6\) in bipartite Eulerian digraph.
• Extremal digraphs on Woodall‐type condition for Hamiltonian cycles in balanced bipartite digraphs
• Title not available (Why is that?)
• A note on cycles of maximum length in bipartite digraphs
• Sufficient conditions for a balanced bipartite digraph to be even pancyclic

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1817571)