Cycles in 2-factors of balanced bipartite graphs

DOI10.1007/s003730050004zbMath0943.05054OpenAlexW1991466508MaRDI QIDQ1972322

Ronald J. Gould, Linda Lesniak, Michael S. Jacobson, Guantao Chen, Ralph J. Faudree

Publication date: 5 September 2000

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s003730050004

zbMATH Keywords

bipartite graphcycles2-factor

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

Toughness, degrees and 2-factors ⋮ Vertex-disjoint cycles containing specified vertices in a bipartite graph ⋮ A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Degree sum conditions for vertex-disjoint cycles passing through specified vertices ⋮ On 2-factors containing 1-factors in bipartite graphs

This page was built for publication: Cycles in 2-factors of balanced bipartite graphs