Publication:3089374: Difference between revisions
From MaRDI portal
Publication:3089374
Created automatically from import240129110113 |
(No difference)
|
Latest revision as of 21:49, 3 February 2024
zbMATH Open1226.05067MaRDI QIDQ3089374FDOQ3089374
Publication date: 24 August 2011
Title of this publication is not available (Why is that?)
Cited In (59)
- Hamilton transversals in random Latin squares
- $ k$-однородные латинские квадраты, их трансверсали и условие ортогональности
- Programming with MATLAB to color latin squares
- All group‐based latin squares possess near transversals
- Constructing MRD codes by switching
- On a rainbow extremal problem for color‐critical graphs
- Transversals, near transversals, and diagonals in iterated groups and quasigroups
- Parity of transversals of Latin squares
- Longest partial transversals in plexes
- Graceful labelling: state of the art, applications and future directions
- Latin squares with no transversals
- Title not available (Why is that?)
- On the maximum number of Latin transversals
- Transversals of Latin squares and covering radius of sets of permutations
- Transversals, plexes, and multiplexes in iterated quasigroups
- A natural generalization of orthogonality of Latin squares
- Transversals in completely reducible multiary quasigroups and in multiary quasigroups of order 4
- Additive triples of bijections, or the toroidal semiqueens problem
- A generalization of transversals for Latin squares
- An asymptotic for the Hall-Paige conjecture
- Permanents of multidimensional matrices: Properties and applications
- On the number of transversals in Latin squares
- Positiveness of the permanent of 4-dimensional polystochastic matrices of order 4
- Large rainbow matchings in semi-strong edge-colorings of graphs
- On NP-hard graph properties characterized by the spectrum
- On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs
- Balanced diagonals in frequency squares
- On the chromatic number of Latin square graphs
- Transversals and bipancyclicity in bipartite graph families
- A note on large rainbow matchings in edge-coloured graphs
- Cycle structures of orthomorphisms extending partial orthomorphisms of Boolean groups
- The odd case of Rota's bases conjecture
- Title not available (Why is that?)
- Full rainbow matchings in graphs and hypergraphs
- Differences of Bijections
- A new algorithmic method to compute the chromatic number of dihedral group
- Covering radius in the Hamming permutation space
- Latin squares with maximal partial transversals of many lengths
- Embedding rainbow trees with applications to graph labelling and decomposition
- Rainbow Matchings in Properly Colored Multigraphs
- Rainbow pancyclicity in graph systems
- Title not available (Why is that?)
- Covers and partial transversals of Latin squares
- Transversals in generalized Latin squares
- Title not available (Why is that?)
- $k$-распавшиеся и $k$-однородные латинские квадраты и их трансверсали
- О трансверсалях распавшихся латинских квадратов с тождественной подстановкой ${\chi_{ACDB}}$
- Existence of rainbow matchings in properly edge-colored graphs
- Large matchings in bipartite graphs have a rainbow matching
- On the number of transversals in \(n\)-ary quasigroups of order 4
- Dynamics of a controlled discontinuous computer worm system
- Long directed rainbow cycles and rainbow spanning trees
- Large deviations in random latin squares
- Representation of Large Matchings in Bipartite Graphs
- Multidimensional permanents of polystochastic matrices
- Rainbow matchings and rainbow connectedness
- Title not available (Why is that?)
- An approximate version of a conjecture of Aharoni and Berger
- Zero-sum flows for Steiner systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3089374)