Pages that link to "Item:Q2387188"
From MaRDI portal
The following pages link to Maximal total length of \(k\) disjoint cycles in bitpartite graphs (Q2387188):
Displaying 6 items.
- Partition of a bipartite graph into cycles (Q686183) (← links)
- Packing disjoint cycles over vertex cuts (Q973127) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
- Vertex-disjoint double chorded cycles in bipartite graphs (Q2312791) (← links)
- Partial degree conditions and cycle coverings in bipartite graphs (Q2409530) (← links)
- Covering the vertices of a graph by cycles of prescribed length (Q3035327) (← links)