pith. sign in

arxiv: 1708.04674 · v3 · pith:QAXLIC2Hnew · submitted 2017-08-15 · 🧮 math.CO

A Meyniel-type condition for bipancyclicity in balanced bipartite digraphs

classification 🧮 math.CO
keywords balancedbipartitecommonbipancyclicbipancyclicityconditionconnectedcycle
0
0 comments X
read the original abstract

We prove that a strongly connected balanced bipartite digraph $D$ of order $2a$, $a\geq3$, satisfying $d(u)+d(v)\geq 3a$ for every pair of vertices $u,v$ with a common in-neighbour or a common out-neighbour, is either bipancyclic or a directed cycle of length $2a$.

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.