Partitioning complete multipartite graphs by monochromatic trees

DOI10.1002/jgt.20044zbMath1063.05043OpenAlexW4231988343MaRDI QIDQ4667794

Atsushi Kaneko, Kazuhiro Suzuki, Mikio Kano

Publication date: 21 April 2005

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20044

zbMATH Keywords

tree partition numbercolored complete bipartite graphcolored complete multipartite graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (10)

Monochromatic tree covers and Ramsey numbers for set-coloured graphs ⋮ Heterochromatic tree partition problem in complete tripartite graphs ⋮ Heterochromatic tree partition numbers for complete bipartite graphs ⋮ Vertex partitions of \(r\)-edge-colored graphs ⋮ On the minimum monochromatic or multicolored subgraph partition problems ⋮ The complexity for partitioning graphs by monochromatic trees, cycles and paths ⋮ Heterochromatic tree partition number in complete multipartite graphs ⋮ Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees ⋮ Partitioning complete graphs by heterochromatic trees ⋮ Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey

This page was built for publication: Partitioning complete multipartite graphs by monochromatic trees