On Enomoto's problems in a bipartite graph

DOI10.1007/s11425-009-0012-zzbMath1229.05188OpenAlexW1963586963MaRDI QIDQ1044262

Jin Yan, Yun Shu Gao

Publication date: 11 December 2009

Published in: Science in China. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-009-0012-z

zbMATH Keywords

independent cycles in a bipartite graph

Mathematics Subject Classification ID

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

Related Items (2)

The confirmation of a conjecture on disjoint cycles in a graph ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Large vertex-disjoint cycles in a bipartite graph
• On the maximum number of independent cycles in a bipartite graph
• On 2-factors with prescribed properties in a bipartite graph
• On 2-factors of a bipartite graph
• Proof of a conjecture on cycles in a bipartite graph
• On the maximal number of independent circuits in a graph
• Disjoint triangles and quadrilaterals in a graph
• Graph partition problems into cycles and paths

This page was built for publication: On Enomoto's problems in a bipartite graph