Heterochromatic tree partition problem in complete tripartite graphs

DOI10.1016/j.disc.2011.11.005zbMath1238.05212OpenAlexW2051226103MaRDI QIDQ409432

Shili Wen, Shujun Zhou, Ze-min Jin

Publication date: 13 April 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.11.005

zbMATH Keywords

partitionheterochromatic treemonochromatic tree

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Heterochromatic tree partition number in complete multipartite graphs

Cites Work

• Unnamed Item
• Partitioning complete graphs by heterochromatic trees
• An improved bound for the monochromatic cycle partition number
• Heterochromatic tree partition numbers for complete bipartite graphs
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• Partitioning by monochromatic trees
• Vertex coverings by monochromatic cycles and trees
• Partitioning complete bipartite graphs by monochromatic cycles
• On the minimum monochromatic or multicolored subgraph partition problems
• Highly connected monochromatic subgraphs
• Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees
• Monochromatic Paths in Graphs
• Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
• Partitioning complete multipartite graphs by monochromatic trees
• Vertex coverings by monochromatic paths and cycles

This page was built for publication: Heterochromatic tree partition problem in complete tripartite graphs