BibTeX
CSL-JSON
MLA
Harvard
A Meyniel-type condition for bipancyclicity in balanced bipartite
digraphs
release_463dghuiyfcohiwxib7qk5sku4
by
Janusz Adamus
Released
as a article
.
2017
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.
In text/plain
format
Archived Files and Locations
application/pdf 126.9 kB
file_cectgh5gljfmtfsbv5z2dmhnq4
|
arxiv.org (repository) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
arXiv
1708.04674v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links