The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes
From MaRDI portal
Publication:765320
DOI10.1016/j.dam.2011.07.022zbMath1241.05033MaRDI QIDQ765320
Publication date: 19 March 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.07.022
05C38: Paths and cycles
05C15: Coloring of graphs and hypergraphs
05C12: Distance in graphs
94B99: Theory of error-correcting codes and error-detecting codes
05C76: Graph operations (line graphs, products, etc.)
Related Items
The \(k\)-distance independence number and 2-distance chromatic number of Cartesian products of cycles, The square chromatic number of the torus, Steganographic schemes from perfect codes on Cayley graphs, Perfect one-factorizations arising from the Lee metric
Uses Software
Cites Work
- Unnamed Item
- On a hypercube coloring problem
- Coloring the square of the Cartesian product of two cycles
- Acyclic colorings of products of trees
- MDS codes over finite principal ideal rings
- Acyclic and \(k\)-distance coloring of the grid
- Choosability of the square of planar subcubic graphs with large girth
- A coloring problem on the \(n\)-cube
- New bounds on a hypercube coloring problem.
- A bound on the chromatic number of the square of a planar graph
- New upper bounds on Lee codes
- List Colouring Squares of Planar Graphs
- Optimal Lee-Type Local Structures in Cartesian Products of Cycles and Paths
- List-coloring the square of a subcubic graph
- List-Coloring Squares of Sparse Subcubic Graphs
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Fundamentals of Error-Correcting Codes
- Perfect Codes in the Lee Metric and the Packing of Polyominoes
- Introduction to Coding Theory
