A degree sum condition for hamiltonicity in balanced bipartite digraphs
Abstract
We prove that a strongly connected balanced bipartite digraph D of order 2a is hamiltonian, provided a≥3 and d(x)+d(y)≥ 3a for every pair of vertices x, y with a common in-neighbour or a common out-neighbour in D.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.