Cycles and paths of many lengths in bipartite digraphs
type: Item
instance of: scholarly article
title: Cycles and paths of many lengths in bipartite digraphs
zbMATH Open document ID: 0712.05031
DOI: 10.1016/0095-8956(90)90081-A
author: Denise Amar
author: Y. Manoussakis
published in: Journal of Combinatorial Theory. Series B
publication date: 1990-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 4170936
zbMATH Keywords: paths
zbMATH Keywords: bipartite digraph
zbMATH Keywords: cycle
reviewed by: J. W. Moon
MaRDI profile type: Publication
cites work: Cycles of Each Length in Regular Tournaments
cites work: Cycles in bipartite tournaments
cites work: Q5615282
cites work: Cycles in digraphs– a survey
cites work: On pancyclic digraphs
cites work: Long paths and cycles in oriented graphs
cites work: Q3487412
cites work: Bipartite graphs with cycles of all even lengths
cites work: On Hamiltonian bipartite graphs
cites work: Long Cycles in Digraphs
cites work: An Ore-type condition implying a digraph to be pancyclic
full work available at URL: 0095-8956(90)90081-a
OpenAlex ID: W2081397477
description: scientific article; zbMATH DE number 4170936