Partition of a bipartite graph into cycles

DOI10.1016/0012-365X(93)90345-TzbMath0794.05059OpenAlexW2031355698MaRDI QIDQ686183

Hong Wang

Publication date: 1 November 1993

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90345-t

zbMATH Keywords

bipartite graphcycle partition

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)

Related Items

Two vertex-disjoint cycles in a graph ⋮ Disjoint directed cycles with specified lengths in directed bipartite graphs ⋮ On a conjecture on directed cycles in a directed bipartite graph ⋮ Partition of a directed bipartite graph into two directed cycles

Cites Work

• Edge disjoint placement of graphs
• On circuits in graphs
• A method in graph theory
• Unnamed Item