Pages that link to "Item:Q2221921"
From MaRDI portal
The following pages link to Minimum degree conditions for monochromatic cycle partitioning (Q2221921):
Displaying 7 items.
- Covering graphs by monochromatic trees and Helly-type results for hypergraphs (Q2043761) (← links)
- Monochromatic square-cycle and square-path partitions (Q2065889) (← links)
- Monochromatic cycle partitions in random graphs (Q4993124) (← links)
- Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles (Q6046228) (← links)
- Properly colored cycles of different lengths in edge-colored complete graphs (Q6056740) (← links)
- An improvement on Łuczak's connected matchings method (Q6133269) (← links)
- Partitioning a 2-edge-coloured graph of minimum degree \(2n/3 + o(n)\) into three monochromatic cycles (Q6612514) (← links)
