Pages that link to "Item:Q324825"

The following pages link to Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles (Q324825):

Displaying 20 items.

• Vertex covers by monochromatic pieces -- a survey of results and problems (Q279224) (← links)
• Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles (Q324372) (← links)
• 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)
• Vertex covering with monochromatic pieces of few colours (Q1671656) (← links)
• Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles (Q1689909) (← links)
• Monochromatic square-cycle and square-path partitions (Q2065889) (← links)
• Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths (Q2200044) (← links)
• Long monochromatic paths and cycles in 2-edge-colored multipartite graphs (Q2299254) (← links)
• Monochromatic cycle power partitions (Q2374161) (← links)
• Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees (Q2479574) (← links)
• Monochromatic paths in 2-edge-coloured graphs and hypergraphs (Q2699642) (← links)
• Partitioning 3-coloured complete graphs into three monochromatic paths (Q2857433) (← links)
• (Q3661614) (← links)
• Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles (Q4238172) (← links)
• The complexity for partitioning graphs by monochromatic trees, cycles and paths (Q4652867) (← links)
• Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles (Q5270411) (← links)
• (Q5379842) (redirect page) (← links)
• Local colourings and monochromatic partitions in complete bipartite graphs (Q5890922) (← links)
• Local colourings and monochromatic partitions in complete bipartite graphs (Q5965537) (← links)