首页|Packing 4-Partite Tree into Complete 4-Partite Graph
Packing 4-Partite Tree into Complete 4-Partite Graph
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
万方数据
For graphs G and H,an embedding of G into His an injection φ:V(G)→ V(H)such that φ(a)φ(b)∈ E(H)whenever ab ∈ E(G).A packing of p graphs G1,G2,…,Gp into His a p-tuple Φ=(φ1,φ2,…,φp)such that,for i=1,2,…,p,φi is an embedding of Gi into H and the p sets φi(E(Gi))are mutually disjoint.Motivated by the"Tree Packing Conjecture"made by Gy(a)rf(a)s and Lehel,Wang Hong conjectured that for each k-partite tree,there is a packing of two copies of T(X)into a complete k-partite graph Bn+m(Y),where m=(「)k/2」.In this paper,we confirm this conjecture for k=4.
packing of graphtree packing conjectureembedding of graph
PENG Yanling
展开 >
Department of Mathematics,Suzhou University of Science and Technology,Suzhou 215009,Jiangsu,China
NETL
NSTL
万方数据
