On maximal partial Latin hypercubes

DOI10.1007/s10623-023-01314-5OpenAlexW4388657563MaRDI QIDQ6123056

Diane M. Donovan, Michael John Grannell, Emine Şule Yazıcı

Publication date: 4 March 2024

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

Full work available at URL: https://doi.org/10.1007/s10623-023-01314-5

zbMATH Keywords

covering radiuscodesLatin hypercubesindependent dominating setspartial Latin hypercubes

Mathematics Subject Classification ID

Bounds on codes (94B65) Orthogonal arrays, Latin squares, Room squares (05B15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Approximating latin square extensions
• New results on codes with covering radius 1 and minimum distance \(2\)
• Independent domination in graphs: A survey and recent results
• Maximal partial Latin cubes
• Covering Theorems for Vectors with Special Reference to the Case of Four and Five Components
• Coverings by rook domains
• On the interval containing at least one prime number
• On codes with given minimum distance and covering radius

This page was built for publication: On maximal partial Latin hypercubes