Partition of a bipartite graph into cycles
From MaRDI portal
Publication:686183
DOI10.1016/0012-365X(93)90345-TzbMath0794.05059MaRDI QIDQ686183
Publication date: 1 November 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
05C38: Paths and cycles
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C75: Structural characterization of families of graphs
05C45: Eulerian and Hamiltonian graphs
Related Items
Partition of a directed bipartite graph into two directed cycles, On a conjecture on directed cycles in a directed bipartite graph, Two vertex-disjoint cycles in a graph
Cites Work