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
Cites work
Cited in
(16)- Disjoint directed cycles with specified lengths in directed bipartite graphs
- Covering the vertices of a graph by cycles of prescribed length
- Cycle partitions of regular graphs
- scientific article; zbMATH DE number 6501194 (Why is no real title available?)
- Partitioning a graph into cycles with a specified number of chords
- Two vertex-disjoint cycles in a graph
- scientific article; zbMATH DE number 2186975 (Why is no real title available?)
- Partitioning a graph into two square-cycles
- Maximal total length of \(k\) disjoint cycles in bitpartite graphs
- A note on a cycle partition problem
- scientific article; zbMATH DE number 5914863 (Why is no real title available?)
- 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
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)