Cycles and paths of many lengths in bipartite digraphs (Q923098)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:923098 |
scientific article; zbMATH DE number 4170936
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cycles and paths of many lengths in bipartite digraphs |
scientific article; zbMATH DE number 4170936 |
Statements
Cycles and paths of many lengths in bipartite digraphs (English)
0 references
1990
0 references
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.
0 references
paths
0 references
bipartite digraph
0 references
cycle
0 references
0.8686695694923401
0 references
0.8574787378311157
0 references
