Sufficient conditions for Hamiltonian cycles in bipartite digraphs

DOI10.1016/j.dam.2018.11.024zbMath1407.05138arXiv1604.08733OpenAlexW2904600371MaRDI QIDQ1732099

Samvel Kh. Darbinyan

Publication date: 22 March 2019

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

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

zbMATH Keywords

Hamiltonian cyclesperfect matchingbipartite digraphslongest non-Hamiltonian cycles

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Extremal digraphs on Woodall‐type condition for Hamiltonian cycles in balanced bipartite digraphs ⋮ On dominating pair degree conditions for Hamiltonicity in balanced bipartite digraphs ⋮ The structure of 2-colored best match graphs ⋮ 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A degree condition for cycles of maximum length in bipartite digraphs
• A survey on Hamilton cycles in directed graphs
• Cycles and paths of many lengths in bipartite digraphs
• A short proof of Meyniel's theorem
• A new sufficient condition for a digraph to be Hamiltonian
• Sufficient conditions for a balanced bipartite digraph to be even pancyclic
• A sufficient condition for maximum cycles in bipartite digraphs
• Cycles and paths in bipartite tournaments with spanning configurations
• A degree sum condition for Hamiltonicity in balanced bipartite digraphs
• A Meyniel-type condition for bipancyclicity in balanced bipartite digraphs
• Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
• Long Cycles in Digraphs
• Cycles in digraphs– a survey
• Directed hamiltonian graphs
• A sufficient condition for a balanced bipartite digraph to be hamiltonian
• A sufficient condition for the hamiltonian property of digraphs with large semi-degrees
• Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
• On the Meyniel condition for hamiltonicity in bipartite digraphs
• Sufficient Conditions for Circuits in Graphs^†

This page was built for publication: Sufficient conditions for Hamiltonian cycles in bipartite digraphs