A degree condition for cycles of maximum length in bipartite digraphs

DOI10.1016/J.DISC.2011.11.032zbMath1238.05149arXiv1101.4973OpenAlexW1980634280MaRDI QIDQ409445

Janusz Adamus, Lech Adamus

Publication date: 13 April 2012

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

Full work available at URL: https://arxiv.org/abs/1101.4973

zbMATH Keywords

cycledigraphbipartite digraphhamiltonicity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

Unnamed Item ⋮ Extremal digraphs on Woodall‐type condition for Hamiltonian cycles in balanced bipartite digraphs ⋮ Sufficient conditions for Hamiltonian cycles in bipartite digraphs ⋮ New sufficient conditions for bipancyclicity of balanced bipartite digraphs ⋮ A note on dominating pair degree condition for Hamiltonian cycles in balanced bipartite digraphs ⋮ Extremal digraphs on Meyniel-type condition for hamiltonian cycles in balanced bipartite digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Cycles and paths of many lengths in bipartite digraphs
• A short proof of Meyniel's theorem
• A sufficient condition for maximum cycles in bipartite digraphs
• Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
• Cycles in digraphs– a survey
• Sufficient Conditions for Circuits in Graphs^†

This page was built for publication: A degree condition for cycles of maximum length in bipartite digraphs