Những tài liệu gần giống với tài liệu bạn đang xem
H Decompositions of r graphs when H is an r graph with exactly 2 edges
Given two r-graphs G and H, an H-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a graph isomorphic to H. The minimum number of parts in an H-decomposition of G is denoted by φr H(G). By a
pdf Đăng bởi
ngaymuadong3
