Pages that link to "Item:Q2857433"
From MaRDI portal
The following pages link to Partitioning 3-coloured complete graphs into three monochromatic paths (Q2857433):
Displaying 10 items.
- Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles (Q324825) (← links)
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths (Q402591) (← links)
- Partitioning 2-edge-colored graphs by monochromatic paths and cycles (Q484546) (← links)
- Partitioning 3-colored complete graphs into three monochromatic cycles (Q540032) (← links)
- Partitioning by monochromatic trees (Q1125948) (← links)
- Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs (Q1783629) (← links)
- Monochromatic square-cycle and square-path partitions (Q2065889) (← links)
- Partitioning 2-edge-colored Ore-type graphs by monochromatic cycles (Q2800590) (← links)
- Partitioning 3-coloured complete graphs into three monochromatic paths (Q2857433) (← links)
- One-sided coverings of colored complete bipartite graphs (Q3424878) (← links)