The following pages link to On a cycle partition problem (Q998373):
Displaying 7 items.
- A note on a cycle partition problem (Q533476) (← links)
- Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture (Q965246) (← links)
- Minimum cycle partition with length requirements (Q2110416) (← links)
- Grinstead's conjecture is true for graphs with a small clique number (Q2433715) (← links)
- Cycle partition of two-connected and two-edge connected graphs (Q2516513) (← links)
- Mad Tea Party Cyclic Partitions (Q2901256) (← links)
- (Q4584074) (← links)