Partition of a bipartite graph into cycles
DOI10.1016/0012-365X(93)90345-TzbMATH Open0794.05059OpenAlexW2031355698MaRDI QIDQ686183FDOQ686183
Authors: 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
Recommendations
- Partition of a bipartite Hamiltonian graph into two cycles
- Vertex-disjoint cycles containing specified vertices in a bipartite graph
- Large vertex-disjoint cycles in a bipartite graph
- Partition of a directed bipartite graph into two directed cycles
- Maximal total length of \(k\) disjoint cycles in bitpartite graphs
Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Cites Work
Cited In (16)
- Covering the vertices of a graph by cycles of prescribed length
- Cycle partitions of regular graphs
- Title not available (Why is that?)
- Partitioning a graph into cycles with a specified number of chords
- Two vertex-disjoint cycles in a graph
- Title not available (Why is that?)
- Partitioning a graph into two square-cycles
- Maximal total length of \(k\) disjoint cycles in bitpartite graphs
- Title not available (Why is that?)
- A note on a cycle partition problem
- Partition of a travel into circuits
- A partition of bipartite graphs with 4-cycle and 8-cycle
- Partition of a bipartite Hamiltonian graph into two cycles
- Partition of a directed bipartite graph into two directed cycles
- On a conjecture on directed cycles in a directed bipartite graph
- Disjoint directed cycles with specified lengths in directed bipartite graphs
This page was built for publication: Partition of a bipartite graph into cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686183)
