2-factors in dense bipartite graphs

DOI10.1016/S0012-365X(02)00435-1zbMath1008.05119OpenAlexW1970974151MaRDI QIDQ1850018

Andrzej Czygrinow, Henry A. Kierstead

Publication date: 2 December 2002

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00435-1

zbMATH Keywords

cyclebipartite graphblow-up lemma

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Hamiltonian cycles with all small even chords ⋮ Semi-degree threshold for anti-directed Hamiltonian cycles ⋮ On prisms, Möbius ladders and the cycle space of dense graphs ⋮ Spanning 3-colourable subgraphs of small bandwidth in dense graphs ⋮ Proof of the bandwidth conjecture of Bollobás and Komlós ⋮ Dirac's Condition for Spanning Halin Subgraphs

This page was built for publication: 2-factors in dense bipartite graphs