Pages that link to "Item:Q5379835"
From MaRDI portal
The following pages link to Almost partitioning 2‐colored complete 3‐uniform hypergraphs into two monochromatic tight or loose cycles (Q5379835):
Displaying 6 items.
- Monochromatic square-cycle and square-path partitions (Q2065889) (← links)
- Towards Lehel's conjecture for 4-uniform tight cycles (Q2111790) (← links)
- Minimum degree conditions for monochromatic cycle partitioning (Q2221921) (← links)
- Monochromatic paths in 2-edge-coloured graphs and hypergraphs (Q2699642) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles (Q6046228) (← links)
