Large vertex-disjoint cycles in a bipartite graph
From MaRDI portal
Publication:1586586
DOI10.1007/s003730070017zbMath0963.05079OpenAlexW2091699090MaRDI QIDQ1586586
Publication date: 28 June 2001
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003730070017
Related Items (5)
Cycles of Given Size in a Dense Graph ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Packing disjoint cycles over vertex cuts ⋮ On Enomoto's problems in a bipartite graph ⋮ TILING DIRECTED GRAPHS WITH TOURNAMENTS
This page was built for publication: Large vertex-disjoint cycles in a bipartite graph