Colouring games based on autotopisms of Latin hyper-rectangles
From MaRDI portal
Abstract: Every partial colouring of a Hamming graph is uniquely related to a partial Latin hyper-rectangle. In this paper we introduce the -stabilized -colouring game for Hamming graphs, a variant of the -colouring game so that each move must respect a given autotopism of the resulting partial Latin hyper-rectangle. We examine the complexity of this variant by means of its chromatic number. We focus in particular on the bi-dimensional case, for which the game is played on the Cartesian product of two complete graphs, and also on the hypercube case.
Recommendations
- Coloring games on squares of graphs
- Autotopism stabilized colouring games on rook's graphs
- Game colouring of the square of graphs
- scientific article; zbMATH DE number 139777
- ON THE COMPLEXITY OF SOME COLORING GAMES
- Autoparatopism stabilized colouring games on rook's graphs
- Abstract colorings, games and ultrafilters
- Colouring bottomless rectangles and arborescences
- Coloring half-planes and bottomless rectangles
- The orthogonal colouring game
Cites work
- scientific article; zbMATH DE number 1518742 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3335076 (Why is no real title available?)
- A Latin square autotopism secret sharing scheme
- A simple competitive graph coloring algorithm
- Asymmetric directed graph coloring games
- Asymmetric graph coloring games
- Autoparatopisms of Quasigroups and Latin Squares
- Bounds on the number of autotopisms and subsquares of a Latin square
- Classifying partial Latin rectangles
- Cycle structure of autotopisms of quasigroups and Latin squares
- Cycle structures of autotopisms of the Latin squares of order up to 11.
- Game chromatic number of Cartesian product graphs
- Game coloring the Cartesian product of graphs
- Game-perfect graphs
- Gröbner bases and the number of Latin squares related to autotopisms of order \(\leq 7\)
- Homotopies of central quasigroups.
- Latin squares associated to principal autotopisms of long cycles. Application in cryptography
- Latin squares. New developments in the theory and applications
- New families of atomic Latin squares and perfect 1-factorisations.
- ON THE COMPLEXITY OF SOME COLORING GAMES
- On the chromatic number of Latin square graphs
- On the number of Latin squares
- Partial Latin rectangle graphs and autoparatopism groups of partial Latin rectangles with trivial autotopism groups
- Quasigroup automorphisms and symmetric group characters.
- Refined activation strategy for the marking game
- Small latin squares, quasigroups, and loops
- Strongly regular graphs, partial geometries and partially balanced designs
- Symmetries that latin squares inherit from 1‐factorizations
- The Map-Coloring Game
- The Order of Automorphisms of Quasigroups
- The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\)
- The number of Latin squares of order 11
- The set of autotopisms of partial Latin squares
- The spectrum for quasigroups with cyclic automorphisms and additional symmetries.
Cited in
(7)- Computing Autotopism Groups of Partial Latin Rectangles
- A historical perspective of the theory of isotopisms
- Refining invariants for computing autotopism groups of partial Latin rectangles
- Enumerating partial Latin rectangles
- Autotopism stabilized colouring games on rook's graphs
- Autoparatopism stabilized colouring games on rook's graphs
- scientific article; zbMATH DE number 3926937 (Why is no real title available?)
This page was built for publication: Colouring games based on autotopisms of Latin hyper-rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5198043)
