Pages that link to "Item:Q686183"
From MaRDI portal
The following pages link to Partition of a bipartite graph into cycles (Q686183):
Displaying 16 items.
- A note on a cycle partition problem (Q533476) (← links)
- Partition of a bipartite Hamiltonian graph into two cycles (Q1072572) (← links)
- Partition of a directed bipartite graph into two directed cycles (Q1126308) (← links)
- On a conjecture on directed cycles in a directed bipartite graph (Q1376065) (← links)
- Bipartite graphs containing every possible pair of cycles (Q1817575) (← links)
- Two vertex-disjoint cycles in a graph (Q1906862) (← links)
- Maximal total length of \(k\) disjoint cycles in bitpartite graphs (Q2387188) (← links)
- Disjoint directed cycles with specified lengths in directed bipartite graphs (Q2659188) (← links)
- Partition of a travel into circuits (Q2774164) (← links)
- (Q3011702) (← links)
- Covering the vertices of a graph by cycles of prescribed length (Q3035327) (← links)
- (Q3194453) (← links)
- Proof of a conjecture on cycles in a bipartite graph (Q4261189) (← links)
- Partitioning a graph into two square-cycles (Q4715278) (← links)
- Partitioning a graph into cycles with a specified number of chords (Q5066898) (← links)
- Cycle partitions of regular graphs (Q5886097) (← links)
