The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes

DOI10.1016/J.DAM.2011.07.022MaRDI QIDQ765320zbMATHOpenAlexFDO

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

zbMATH Keywords

Cartesian productcoloringperfect codedistance coloring

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• A bound on the chromatic number of the square of a planar graph
• A coloring problem on the \(n\)-cube
• Acyclic and \(k\)-distance coloring of the grid
• Acyclic colorings of products of trees
• Choosability of the square of planar subcubic graphs with large girth
• Coloring the square of the Cartesian product of two cycles
• Fundamentals of Error-Correcting Codes
• Introduction to Coding Theory
• List Colouring Squares of Planar Graphs
• List-Coloring Squares of Sparse Subcubic Graphs
• List-coloring the square of a subcubic graph
• MDS codes over finite principal ideal rings
• New bounds on a hypercube coloring problem.
• New upper bounds on Lee codes
• On a hypercube coloring problem
• Optimal Lee-Type Local Structures in Cartesian Products of Cycles and Paths
• Perfect Codes in the Lee Metric and the Packing of Polyominoes
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes

Cited in

(6)

• The square chromatic number of the torus
• Perfect one-factorizations arising from the Lee metric
• The \(k\)-distance independence number and 2-distance chromatic number of Cartesian products of cycles
• New bounds on some Lee codes
• Steganographic schemes from perfect codes on Cayley graphs
• Distance-2 MDS codes and Latin colorings in the Doob graphs

Describes a project that uses

Uses Software

• Magma

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)