Partitioning complete graphs by heterochromatic trees

DOI10.1007/s10255-012-0177-zzbMath1254.05157arXiv0711.2849MaRDI QIDQ692699

Ze-min Jin, Xue Liang Li

Publication date: 6 December 2012

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0711.2849

zbMATH Keywords

partition; edge-colored graph; heterochromatic tree

Mathematics Subject Classification ID

05C05: Trees

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C75: Structural characterization of families of graphs

05C15: Coloring of graphs and hypergraphs

Related Items

Heterochromatic tree partition problem in complete tripartite graphs, Heterochromatic tree partition number in complete multipartite graphs

Cites Work

• Unnamed Item
• An improved bound for the monochromatic cycle partition number
• Heterochromatic tree partition numbers for complete bipartite graphs
• 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
• 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