Partitioning complete multipartite graphs by monochromatic trees
From MaRDI portal
Publication:4667794
DOI10.1002/jgt.20044zbMath1063.05043MaRDI QIDQ4667794
Atsushi Kaneko, Mikio Kano, Kazuhiro Suzuki
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
05C15: Coloring of graphs and hypergraphs
Related Items
The complexity for partitioning graphs by monochromatic trees, cycles and paths, Heterochromatic tree partition problem in complete tripartite graphs, Heterochromatic tree partition numbers for complete bipartite graphs, Vertex partitions of \(r\)-edge-colored graphs, Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey, On the minimum monochromatic or multicolored subgraph partition problems, Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees