A proof on cycles and matching in balanced bipartite graphs

MaRDI QIDQ4901657zbMATH OpenFDO

Authors Furong Lu, Shiying Wang, Lili Zhang

Publication date 24 January 2013

zbMATH Keywords

circlematchingfactorbalanced bipartite graph

Mathematics Subject Classification ID

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

Recommendations

• Proof of a conjecture on cycles in a bipartite graph
• scientific article; zbMATH DE number 2058680
• Bipartite graphs with every matching in a cycle
• Vertex-disjoint cycles containing specified vertices in a bipartite graph
• Cycles in 2-factors of balanced bipartite graphs

Cited in

(3)

• Cycles in 2-factors of balanced bipartite graphs
• Spanning cycles through specified edges in bipartite graphs
• Bipartite graphs with every matching in a cycle

This page was built for publication: A proof on cycles and matching in balanced bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4901657)