Pages that link to "Item:Q4625023"
From MaRDI portal
The following pages link to Monochromatic cycle covers in random graphs (Q4625023):
Displaying 7 items.
- Covering graphs by monochromatic trees and Helly-type results for hypergraphs (Q2043761) (← links)
- Minimum degree conditions for monochromatic cycle partitioning (Q2221921) (← links)
- Monochromatic cycle partitions in random graphs (Q4993124) (← links)
- Covering 3-Edge-Colored Random Graphs with Monochromatic Trees (Q4997138) (← links)
- Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles (Q6046228) (← links)
- Covering random graphs with monochromatic trees (Q6074874) (← links)
- Partitioning a 2-edge-coloured graph of minimum degree \(2n/3 + o(n)\) into three monochromatic cycles (Q6612514) (← links)
