A degree sum condition for Hamiltonicity in balanced bipartite digraphs

DOI10.1007/S00373-016-1751-6MaRDI QIDQ2361075zbMATH OpenOpenAlexFDO

Authors Janusz Adamus

Publication date 29 June 2017

Published in Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

bipartite digraphcycledegree conditiondigraphHamiltonicity

Mathematics Subject Classification ID

Vertex degrees (05C07) Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Abstract: We prove that a strongly connected balanced bipartite digraph $D$ of order $2a$ is hamiltonian, provided $ageq3$ and $d(x)+d(y)geq3a$ for every pair of vertices $x$, $y$ with a common in-neighbour or a common out-neighbour in $D$.

Recommendations

• Sufficient conditions for Hamiltonian cycles in bipartite digraphs
• On the Meyniel condition for Hamiltonicity in bipartite digraphs
• A sufficient condition for a balanced bipartite digraph to be Hamiltonian
• A note on dominating pair degree condition for Hamiltonian cycles in balanced bipartite digraphs
• scientific article; zbMATH DE number 7225861

Cites work

• A new sufficient condition for a digraph to be Hamiltonian
• Cycles and paths of many lengths in bipartite digraphs
• Digraphs
• scientific article; zbMATH DE number 908788 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• On the Meyniel condition for Hamiltonicity in bipartite digraphs

Cited in

(17)

• A degree sum condition on Hamiltonian cycles in balanced 3-partite graphs
• Sufficient conditions for Hamiltonian cycles in bipartite digraphs
• A note on dominating pair degree condition for Hamiltonian cycles in balanced bipartite digraphs
• On dominating pair degree conditions for Hamiltonicity in balanced bipartite digraphs
• A Meyniel-type condition for bipancyclicity in balanced bipartite digraphs
• scientific article; zbMATH DE number 7225861 (Why is no real title available?)
• A degree condition for cycles of maximum length in bipartite digraphs
• A sufficient condition for a balanced bipartite digraph to be Hamiltonian
• Extremal digraphs on Meyniel-type condition for Hamiltonian cycles in balanced bipartite digraphs
• Some new sufficient conditions for 2p-Hamilton-biconnectedness of graphs
• On the Meyniel condition for Hamiltonicity in bipartite digraphs
• A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity
• Degree sum condition on distance 2 vertices for Hamiltonian cycles in balanced bipartite graphs
• Extremal digraphs on Woodall‐type condition for Hamiltonian cycles in balanced bipartite digraphs
• A new sufficient condition for a 2-strong digraph to be Hamiltonian
• Hamiltonicity and bipancyclicity of balanced bipartite digraphs
• Cycles of many lengths in balanced bipartite digraphs on dominating and dominated degree conditions

This page was built for publication: A degree sum condition for Hamiltonicity in balanced bipartite digraphs

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