Monochromatic tree partition for complete multipartite graphs

MaRDI QIDQ2898721zbMATH OpenFDO

Authors Shili Wen, Peipei Zhu

Publication date 11 July 2012

Published in International Journal of Contemporary Mathematical Sciences (Search for Journal in Brave)

Full work available at URL http://www.m-hikari.com/ijcms-2011/41-44-2011/index.html

zbMATH Keywords

complete multipartite graphmonochromatic treepartition number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• Partitioning complete multipartite graphs by monochromatic trees
• Partitioning 3-edge-colored complete equi-bipartite graphs by monochromatic trees under a color degree condition
• Heterochromatic tree partition number in complete multipartite graphs
• Heterochromatic tree partition numbers for complete bipartite graphs
• Heterochromatic tree partition problem in complete tripartite graphs

Cited in

(9)

• Partitioning 3-edge-colored complete equi-bipartite graphs by monochromatic trees under a color degree condition
• Heterochromatic tree partition number in complete multipartite graphs
• Heterochromatic tree partition problem in complete tripartite graphs
• The complexity for partitioning graphs by monochromatic trees, cycles and paths
• Partitioning complete multipartite graphs by monochromatic trees
• Special monochromatic trees in two-colored complete graphs
• Monochromatic \(K_{r}\)-decompositions of graphs
• Partitioning complete graphs by heterochromatic trees
• Heterochromatic tree partition numbers for complete bipartite graphs

This page was built for publication: Monochromatic tree partition for complete multipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2898721)