A sufficient condition for maximum cycles in bipartite digraphs (Q1817571)
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: A sufficient condition for maximum cycles in bipartite digraphs |
scientific article; zbMATH DE number 1382639
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sufficient condition for maximum cycles in bipartite digraphs |
scientific article; zbMATH DE number 1382639 |
Statements
A sufficient condition for maximum cycles in bipartite digraphs (English)
0 references
2 March 2000
0 references
Let \(a\) denote the size of the smaller colour class of a directed bipartite graph \(D\). The authors show that \(D\) has a cycle of length \(2a\) if for any two nodes \(u\) and \(v\) of \(D\) either \(v\) dominates \(u\) or the sum of the in-degree of \(u\) and the out-degree of \(v\) is at least \(a+2\).
0 references
digraph
0 references
directed bipartite graph
0 references
cycle
0 references
