English

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 DD of order 2a2a, a3a\geq3, satisfying d(u)+d(v)3ad(u)+d(v)\geq 3a for every pair of vertices u,vu,v with a common in-neighbour or a common out-neighbour, is either bipancyclic or a directed cycle of length 2a2a.

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

R2 v1 2026-06-22T21:15:33.733Z