On dominating pair degree conditions for hamiltonicity in balanced\n bipartite digraphs

2020/05/04 by Janusz Adamus, Adamus, Janusz
Computer Science · Mathematics · #Advanced Graph Theory Research #Graph theory and applications #Interconnection Networks and Systems

paper · pdf · doi:10.48550/arxiv.2005.01466

Abstract

We prove several new sufficient conditions for hamiltonicity and\nbipancyclicity in balanced bipartite digraphs, in terms of sums of degrees over\ndominating or dominated pairs of vertices.\n

Related

• A degree sum condition for hamiltonicity in balanced bipartite digraphs
• Sufficient conditions for Hamiltonian cycles in bipartite digraphs
• On the Meyniel condition for hamiltonicity in bipartite digraphs
• A sufficient condition for pre-Hamiltonian cycles in bipartite digraphs
• Some sufficient conditions on Hamiltonian digraph