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 7 items.
- A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length (Q528481) (← links)
- Vertex partitions of \(r\)-edge-colored graphs (Q933003) (← links)
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey (Q1014813) (← links)
- Covering graphs by monochromatic trees and Helly-type results for hypergraphs (Q2043761) (← 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)
- On the complexity of edge-colored subgraph partitioning problems in network optimization (Q2816508) (← links)