The \(k\)-distance independence number and 2-distance chromatic number of Cartesian products of cycles

DOI10.1007/s40840-016-0397-0zbMath1393.05202OpenAlexW2467001893MaRDI QIDQ723608

Aleksander Vesel, Zehui Shao, Jin Xu

Publication date: 24 July 2018

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-016-0397-0

zbMATH Keywords

cycleindependence numberchromatic numberCartesian productsquare graphLee code

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Uses Software

• nauty

Cites Work

• Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\)
• Coloring the square of the Cartesian product of two cycles
• The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes
• Fast decoding of quasi-perfect Lee distance codes
• Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
• A note on the chromatic number of the square of the Cartesian product of two cycles
• New upper bounds on Lee codes
• Fundamentals of Error-Correcting Codes
• Context Coding of Depth Map Images Under the Piecewise-Constant Image Model Representation
• Error-correcting codes over an alphabet of four elements
• Bounds on codes over an alphabet of five elements

This page was built for publication: The \(k\)-distance independence number and 2-distance chromatic number of Cartesian products of cycles