On dominating pair degree conditions for Hamiltonicity in balanced bipartite digraphs

DOI10.1016/J.DISC.2020.112240zbMath1456.05094arXiv2005.01466OpenAlexW3111718953MaRDI QIDQ2222944

Janusz Adamus

Publication date: 27 January 2021

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

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

zbMATH Keywords

cycleHamiltonicitybipartite digraphbipancyclicitydegree conditiondominating pair

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Ore-type condition implying a digraph to be pancyclic
• Sufficient conditions for Hamiltonian cycles in bipartite digraphs
• New sufficient conditions for bipancyclicity of 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
• Digraphs

This page was built for publication: On dominating pair degree conditions for Hamiltonicity in balanced bipartite digraphs