The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes
DOI10.1016/J.DAM.2011.07.022zbMATH Open1241.05033OpenAlexW2126248320MaRDI QIDQ765320FDOQ765320
Authors: Jon-Lark Kim, Seog-Jin Kim 
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
Recommendations
- The \(k\)-distance independence number and 2-distance chromatic number of Cartesian products of cycles
- New bounds on some Lee codes
- The 2-distance chromatic number of Cartesian product of graphs
- Coloring the square of the Cartesian product of two cycles
- 2-distance chromatic number of some graph products
Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76) Theory of error-correcting codes and error-detecting codes (94B99)
Cites Work
- Title not available (Why is that?)
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Fundamentals of Error-Correcting Codes
- Introduction to Coding Theory
- Choosability of the square of planar subcubic graphs with large girth
- List-coloring the square of a subcubic graph
- A bound on the chromatic number of the square of a planar graph
- A coloring problem on the \(n\)-cube
- New bounds on a hypercube coloring problem.
- On a hypercube coloring problem
- Acyclic and \(k\)-distance coloring of the grid
- List Colouring Squares of Planar Graphs
- List-Coloring Squares of Sparse Subcubic Graphs
- MDS codes over finite principal ideal rings
- Perfect Codes in the Lee Metric and the Packing of Polyominoes
- Coloring the square of the Cartesian product of two cycles
- New upper bounds on Lee codes
- Optimal Lee-Type Local Structures in Cartesian Products of Cycles and Paths
- Acyclic colorings of products of trees
Cited In (5)
- Steganographic schemes from perfect codes on Cayley graphs
- Distance-2 MDS codes and Latin colorings in the Doob graphs
- The \(k\)-distance independence number and 2-distance chromatic number of Cartesian products of cycles
- The square chromatic number of the torus
- Perfect one-factorizations arising from the Lee metric
Uses Software
This page was built for publication: The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765320)
