A Meyniel-type condition for bipancyclicity in balanced bipartite digraphs
Combinatorics
2018-05-25 v3
Abstract
We prove that a strongly connected balanced bipartite digraph of order , , satisfying for every pair of vertices with a common in-neighbour or a common out-neighbour, is either bipancyclic or a directed cycle of length .
Keywords
Cite
@article{arxiv.1708.04674,
title = {A Meyniel-type condition for bipancyclicity in balanced bipartite digraphs},
author = {Janusz Adamus},
journal= {arXiv preprint arXiv:1708.04674},
year = {2018}
}
Comments
Final version, to appear in Graphs Combin