A Meyniel-type condition for bipancyclicity in balanced bipartite digraphs
Abstract
We prove that a strongly connected balanced bipartite digraph D of order 2a, a≥3, satisfying d(u)+d(v)≥ 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.