Pages that link to "Item:Q324372"
From MaRDI portal
The following pages link to Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles (Q324372):
Displaying 12 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)
- Triangulations of the sphere, bitrades and abelian groups (Q484547) (← links)
- Partitioning 3-colored complete graphs into three monochromatic cycles (Q540032) (← links)
- Partitioning 3-edge-colored complete equi-bipartite graphs by monochromatic trees under a color degree condition (Q1010866) (← links)
- Partitioning complete bipartite graphs by monochromatic cycles (Q1354726) (← links)
- Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles (Q1689909) (← links)
- Disjoint properly colored cycles in edge-colored complete bipartite graphs (Q2092322) (← links)
- Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths (Q2200044) (← links)
- Partitioning 3-coloured complete graphs into three monochromatic paths (Q2857433) (← links)
- Local colourings and monochromatic partitions in complete bipartite graphs (Q5890922) (← links)
- Local colourings and monochromatic partitions in complete bipartite graphs (Q5965537) (← links)