The server is under maintenance between 08:00 to 12:00 (GMT+08:00), and please visit later.
We apologize for any inconvenience caused
Login  | Sign Up  |  Oriprobe Inc. Feed
China/Asia On Demand
Journal Articles
Laws/Policies/Regulations
Companies/Products
Bookmark and Share
Natural Proof of Tree Partition Number of Complete Multipartite Graphs
Author(s): 
Pages: 195-198
Year: Issue:  24
Journal: Mathematics in Practice and Theory

Keyword:  monochromatictree partition numbercomplete multipartite graphs;
Abstract: r-边染色图G的树划分数tr(G)定义为最小的正整数k,使得只要用r种颜色对图G进行边染色,则存在至多k个顶点不交的单色树覆盖图G的所有顶点.Kaneko等确定了t2(K(n1,n2,…,nk))的精确表达式.本文给出了该表达式的一个直观证明.
Related Articles
No related articles found