Heterochromatic tree partition number of a complete multipartite graph

2005/11/22 by He Chen, Zemin Jin, Chen, He +5
Computer Science · Mathematics · #05C05 #05C15 #05C70 #05C75 #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications #Limits and Structures in Graph Theory #math.CO #msc:05C05 #msc:05C15 #msc:05C70 #msc:05C75

paper · pdf · doi:10.48550/arxiv.math/0511544

This paper has been withdrawn

openalex publication_date 2005/11/22 · arxiv created 2007/11/30 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper has been withdrawn by the author(s), due an error in the proof.

Related

• Partitioning complete graphs by heterochromatic trees
• Partitioning 3-edge-colored complete equi-bipartite graphs by monochromatic trees under a color degree condition
• Separating Tree-chromatic number from Path-chromatic Number
• Separation Number and Treewidth, Revisited
• Partitioning a graph into monochromatic connected subgraphs