Cycles in 2-factors of balanced bipartite graphs
type: Item
instance of: scholarly article
title: Cycles in 2-factors of balanced bipartite graphs
zbMATH Open document ID: 0943.05054
published in: Graphs and Combinatorics
publication date: 2000-09-05T00:00:00Z
review text: Let \(G\) be a balanced bipartite graph of order \(2n\) \((n\geq 2)\) such that \(\deg u+\deg v\geq n+1\) for each pair of non-adjacent vertices from different partite sets. \textit{J. W. Moon} and \textit{L. Moser} [Isr. J. Math. 1, 163-165 (1963; Zbl 0119.38806)] showed that such a graph \(G\) has a spanning cycle. The authors of the present paper show that if \(k\) is a positive integer such that \(n\geq \max\{51,k^2/2+ 1\}\), then such a graph \(G\) also has a 2-factor with exactly \(k\) cycles.
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 1436039
zbMATH Keywords: bipartite graph
zbMATH Keywords: 2-factor
zbMATH Keywords: cycles
author: Guantao Chen
author: Ralph Faudree
author: Ronald Gould
author: Michael Jacobson
author: Linda Lesniak
reviewed by: J. W. Moon
MaRDI profile type: Publication
full work available at URL: s003730050004
OpenAlex ID: W1991466508
DOI: 10.1007/S003730050004
Recommended article: Q4679661
Recommended article: On 2-factors with cycles containing specified vertices in a bipartite graph
Recommended article: On 2-factors with cycles containing specified edges in a bipartite graph
Recommended article: Q5453044
Recommended article: On factor-invariant graphs with two cycles
Recommended article: Balanced cycles and holes in bipartite graphs
Recommended article: Cyclic uniform 2-factorizations of the complete multipartite graph
Recommended article: On 2-cycles of graphs
Recommended article: Q4901657
Recommended article: Cyclability in bipartite graphs
description: scientific article; zbMATH DE number 1436039