Pages that link to "Item:Q4652867"
From MaRDI portal
The following pages link to The complexity for partitioning graphs by monochromatic trees, cycles and paths (Q4652867):
Displaying 4 items.
- Vertex partitions of \(r\)-edge-colored graphs (Q933003) (← links)
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey (Q1014813) (← 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)
