Partitioning complete graphs by heterochromatic trees

DOI10.1007/S10255-012-0177-ZzbMath1254.05157arXiv0711.2849OpenAlexW2049494157MaRDI 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

partitionedge-colored graphheterochromatic tree

Mathematics Subject Classification ID

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

Related Items (2)

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

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