A sufficient condition for maximum cycles in bipartite digraphs
type: Item
instance of: scholarly article
title: A sufficient condition for maximum cycles in bipartite digraphs
zbMATH Open document ID: 0939.05044
DOI: 10.1016/S0012-365X(98)00352-5
author: Y. Manoussakis
author: Ioannis Milis
published in: Discrete Mathematics
publication date: 2000-03-02T00:00:00Z
review text: 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\).
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1382639
zbMATH Keywords: digraph
zbMATH Keywords: directed bipartite graph
zbMATH Keywords: cycle
reviewed by: J. W. Moon
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1382639