Pages that link to "Item:Q4667794"

The following pages link to Partitioning complete multipartite graphs by monochromatic trees (Q4667794):

Displaying 9 items.

• Heterochromatic tree partition problem in complete tripartite graphs (Q409432) (← links)
• Partitioning complete graphs by heterochromatic trees (Q692699) (← links)
• Heterochromatic tree partition numbers for complete bipartite graphs (Q932639) (← links)
• Vertex partitions of \(r\)-edge-colored graphs (Q933003) (← links)
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey (Q1014813) (← links)
• Heterochromatic tree partition number in complete multipartite graphs (Q2251133) (← links)
• Monochromatic tree covers and Ramsey numbers for set-coloured graphs (Q2411628) (← links)
• On the minimum monochromatic or multicolored subgraph partition problems (Q2456352) (← links)
• Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees (Q2479574) (← links)