Petersen graph decompositions of complete multipartite graphs

DOI10.1007/S00373-010-0925-XzbMath1218.05155OpenAlexW1993104335MaRDI QIDQ604998

Dengju Ma, Jin-Hua Wang

Publication date: 12 November 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0925-x

zbMATH Keywords

decompositiongroup divisible designPetersen graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99) General block designs in finite geometry (51E05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new class of group divisible designs with block size three
• Balanced incomplete block designs and related designs
• \(G\)-designs and related designs
• Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
• A survey on the existence ofG-Designs
• The spectrum problem for the Petersen graph

This page was built for publication: Petersen graph decompositions of complete multipartite graphs