scientific article

Publication date: 24 August 2011

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (54)

Transversals, near transversals, and diagonals in iterated groups and quasigroups ⋮ On the maximum number of Latin transversals ⋮ Latin squares with no transversals ⋮ Full rainbow matchings in graphs and hypergraphs ⋮ Transversals, plexes, and multiplexes in iterated quasigroups ⋮ On the chromatic number of Latin square graphs ⋮ Rainbow Matchings in Properly Colored Multigraphs ⋮ Balanced diagonals in frequency squares ⋮ Unnamed Item ⋮ Cycle structures of orthomorphisms extending partial orthomorphisms of Boolean groups ⋮ Large matchings in bipartite graphs have a rainbow matching ⋮ An approximate version of a conjecture of Aharoni and Berger ⋮ On the number of transversals in $n$-ary quasigroups of order 4 ⋮ Transversals and bipancyclicity in bipartite graph families ⋮ An asymptotic for the Hall-Paige conjecture ⋮ Covers and partial transversals of Latin squares ⋮ Representation of Large Matchings in Bipartite Graphs ⋮ Transversals in completely reducible multiary quasigroups and in multiary quasigroups of order 4 ⋮ Longest partial transversals in plexes ⋮ Long directed rainbow cycles and rainbow spanning trees ⋮ On a rainbow extremal problem for color‐critical graphs ⋮ Permanents of multidimensional matrices: Properties and applications ⋮ Large deviations in random latin squares ⋮ On NP-hard graph properties characterized by the spectrum ⋮ Zero-sum flows for Steiner systems ⋮ All group‐based latin squares possess near transversals ⋮ Dynamics of a controlled discontinuous computer worm system ⋮ Unnamed Item ⋮ A natural generalization of orthogonality of Latin squares ⋮ Embedding rainbow trees with applications to graph labelling and decomposition ⋮ Additive triples of bijections, or the toroidal semiqueens problem ⋮ Differences of Bijections ⋮ Latin squares with maximal partial transversals of many lengths ⋮ Large rainbow matchings in semi-strong edge-colorings of graphs ⋮ Programming with MATLAB to color latin squares ⋮ Parity of transversals of Latin squares ⋮ Rainbow matchings and rainbow connectedness ⋮ Graceful labelling: state of the art, applications and future directions ⋮ Existence of rainbow matchings in properly edge-colored graphs ⋮ Covering radius in the Hamming permutation space ⋮ Multidimensional permanents of polystochastic matrices ⋮ On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs ⋮ Transversals of Latin squares and covering radius of sets of permutations ⋮ On the number of transversals in Latin squares ⋮ A new algorithmic method to compute the chromatic number of dihedral group ⋮ The odd case of Rota's bases conjecture ⋮ A note on large rainbow matchings in edge-coloured graphs ⋮ Rainbow pancyclicity in graph systems ⋮ О трансверсалях распавшихся латинских квадратов с тождественной подстановкой ${\chi_{ACDB}}$ ⋮ $k$-распавшиеся и $k$-однородные латинские квадраты и их трансверсали ⋮ Unnamed Item ⋮ Transversals in generalized Latin squares ⋮ Positiveness of the permanent of 4-dimensional polystochastic matrices of order 4 ⋮ $ k$-однородные латинские квадраты, их трансверсали и условие ортогональности

This page was built for publication: