scientific article; zbMATH DE number 1109398

MaRDI QIDQ4374707zbMATH OpenFDO

Authors Qingxue Huang

Publication date 25 January 1998

zbMATH Keywords

complete \(m\)-partite graphgraph designmultigraph

Mathematics Subject Classification ID

Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Complete multipartite decompositions of complete graphs and complete n-partite graphs
• Decompositions of complete multipartite graphs
• scientific article; zbMATH DE number 734481
• On the decomposition of K_n into complete m‐partite graphs
• scientific article; zbMATH DE number 786153
• Decomposition of Certain Complete Graphs and Complete Multipartite Graphs into Almost-bipartite Graphs and Bipartite Graphs
• Decompositions of complete multipartite graphs via generalized graceful labelings
• scientific article; zbMATH DE number 1186104
• scientific article; zbMATH DE number 874209
• scientific article; zbMATH DE number 4150219

Cited in

(8)

• Decompositions of complete multigraphs related to Hadamard matrices
• Decompositions of complete multigraphs derived from Hadamard matrices
• Complete multipartite decompositions of complete graphs and complete n-partite graphs
• Clique decompositions of multipartite graphs and completion of Latin squares
• Existence on splitting-balanced block designs with resolvability
• On the minimum number of edge‐disjoint complete m‐partite subgraphs into which K_n can be decomposed
• scientific article; zbMATH DE number 734481 (Why is no real title available?)
• Sharp bounds for decompositions of graphs into completer-partite subgraphs

This page was built for publication:

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