Cycles and paths of many lengths in bipartite digraphs (Q923098)
From MaRDI portal
scientific article
In more languages
Configure| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cycles and paths of many lengths in bipartite digraphs |
scientific article |
|
| American English | No label defined |
No description defined |
Statements
Let D denote a bipartite digraph in which each node has indegree and outdegree at least r. The authors show, among other things, that if \(k\leq 2r-1\) then D contains a cycle of length 2k unless D belongs to a class of exceptional graphs which are characterized.
