A degree sum condition for hamiltonicity in balanced bipartite digraphs
classification
🧮 math.CO
keywords
balancedbipartitecommonconditionconnecteddegreedigraphdigraphs
read the original abstract
We prove that a strongly connected balanced bipartite digraph $D$ of order $2a$ is hamiltonian, provided $a\geq3$ and $d(x)+d(y)\geq 3a$ for every pair of vertices $x$, $y$ with a common in-neighbour or a common out-neighbour in $D$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.