Latin hexahedra and related combinatorial structures

DOI10.1007/978-3-031-25211-2_27OpenAlexW4318023116MaRDI QIDQ6132551

Akihiro Yamamura

Publication date: 17 August 2023

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-25211-2_27

zbMATH Keywords

Latin square1-factorizationcomplete tripartite graphregular hexahedroncomplete quadripartite graphsudoku puzzle

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Graph factors and factorization: 1985--2003: a survey
• An application of Tutte's theorem to 1-factorization of regular graphs of high degree
• On 1-factorizability of Cayley graphs
• 1-factorizing regular graphs of high degree - an improved bound
• Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
• One-factorizations of the complete graph—A survey
• Regular Graphs of High Degree are 1-Factorizable

This page was built for publication: Latin hexahedra and related combinatorial structures