2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees

DOI10.1137/080739513zbMath1213.05135OpenAlexW2016126957MaRDI QIDQ5392905

Louis DeBiasio, Henry A. Kierstead, Andrzej Czygrinow

Publication date: 15 April 2011

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/080739513

zbMATH Keywords

bipartite graphs2-factorsblow-up Lemmaregularity Lemmaspanning cycles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

Disjoint Cycles in a Digraph with Partial Degree ⋮ Disjoint cycles covering specified vertices in bipartite graphs with partial degrees ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Dirac's Condition for Spanning Halin Subgraphs

This page was built for publication: 2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees