Orthogonal one-factorizations of complete multipartite graphs

DOI10.1007/s10623-018-0504-3zbMath1410.05170OpenAlexW2730880186WikidataQ114226830 ScholiaQ114226830MaRDI QIDQ2414929

Magdalena Tyniec, Mariusz Meszka

Publication date: 17 May 2019

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-018-0504-3

zbMATH Keywords

orthogonalityLatin squareone-factorizationHowell designroom square

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

A generalization of group divisible t $t$‐designs

Cites Work

• The existence of Howell designs of even side
• On Howell designs
• The spectra of certain classes of room frames: the last cases
• Room designs and one-factorizations
• The existence of Howell designs of odd side
• The existence of Room squares
• Howell designs with sub-designs
• Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
• The chromatic index of complete multipartite graphs
• Uniform room frames with five holes
• On the existence of room frames of type t^u for u = 4 and 5
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Orthogonal one-factorizations of complete multipartite graphs