Pages that link to "Item:Q5270411"
From MaRDI portal
The following pages link to Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles (Q5270411):
Displaying 3 items.
- Monochromatic paths in 2-edge-coloured graphs and hypergraphs (Q2699642) (← links)
- Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles (Q6046228) (← links)
- Partitioning a 2-edge-coloured graph of minimum degree \(2n/3 + o(n)\) into three monochromatic cycles (Q6612514) (← links)
