A note on dominating pair degree condition for Hamiltonian cycles in balanced bipartite digraphs

DOI10.1007/S00373-021-02404-8zbMath1479.05132OpenAlexW4200423347WikidataQ114229627 ScholiaQ114229627MaRDI QIDQ2062898

Ruixia Wang

Publication date: 3 January 2022

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

Full work available at URL: https://doi.org/10.1007/s00373-021-02404-8

zbMATH Keywords

Hamiltonian cycledegree sum conditionbalanced bipartite digraphdominating pair

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A degree condition for cycles of maximum length in bipartite digraphs
• Sufficient conditions for Hamiltonian cycles in bipartite digraphs
• New sufficient conditions for bipancyclicity of balanced bipartite digraphs
• Cycles and paths in bipartite tournaments with spanning configurations
• On dominating pair degree conditions for Hamiltonicity in balanced bipartite digraphs
• A degree sum condition for Hamiltonicity in balanced bipartite digraphs
• A Meyniel-type condition for bipancyclicity in balanced bipartite digraphs
• A sufficient condition for a balanced bipartite digraph to be hamiltonian
• On the Meyniel condition for hamiltonicity in bipartite digraphs
• Extremal digraphs on Woodall‐type condition for Hamiltonian cycles in balanced bipartite digraphs

This page was built for publication: A note on dominating pair degree condition for Hamiltonian cycles in balanced bipartite digraphs