The chromatic number of the square of the $8$-cube

DOI10.1090/mcom/3291zbMath1387.05092arXiv1607.01605OpenAlexW2963301016MaRDI QIDQ4640334

Patric R. J. Östergård, Janne I. Kokkala

Publication date: 17 May 2018

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.01605

zbMATH Keywords

Cayley graphcube-like graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Combinatorial codes (94B25)

Related Items

Chromatic numbers of Cayley graphs of abelian groups: a matrix method, The clique distribution in powers of hypercubes, Coloring the Voronoi tessellation of lattices

Uses Software

• nauty
• Cliquer
• Traces
• libexact

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a hypercube coloring problem
• Classification algorithms for codes and designs
• On the chromatic number of cube-like graphs
• The triply shortened binary Hamming code is optimal
• Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
• A coloring problem on the \(n\)-cube
• New bounds on a hypercube coloring problem.
• Matroidal bijections between graphs
• Constructing error-correcting binary codes using transitive permutation groups
• Practical graph isomorphism. II.
• Binary codes with a minimum distance of four (Corresp.)
• Bounds for binary codes of length less than 25
• Optimal binary one-error-correcting codes of length 10 have 72 codewords
• On the Size of Optimal Three-Error-Correcting Binary Codes of Length 16