A degree sum condition for hamiltonicity in balanced bipartite digraphs
Combinatorics
2015-12-03 v1
Abstract
We prove that a strongly connected balanced bipartite digraph of order is hamiltonian, provided and for every pair of vertices , with a common in-neighbour or a common out-neighbour in .
Keywords
Cite
@article{arxiv.1512.00480,
title = {A degree sum condition for hamiltonicity in balanced bipartite digraphs},
author = {Janusz Adamus},
journal= {arXiv preprint arXiv:1512.00480},
year = {2015}
}
Comments
9 pages. arXiv admin note: text overlap with arXiv:1506.07949 by other authors