Large vertex-disjoint cycles in a bipartite graph
From MaRDI portal
Publication:1586586
DOI10.1007/s003730070017zbMath0963.05079MaRDI 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
05C38: Paths and cycles
Related Items
Packing disjoint cycles over vertex cuts, On Enomoto's problems in a bipartite graph, Cycles of Given Size in a Dense Graph