New results on two hypercube coloring problems

DOI10.1016/j.dam.2013.07.006zbMath1287.05043arXiv1001.2209OpenAlexW2964014596MaRDI QIDQ2446885

San Ling, Xing, Chaoping, Fang-Wei Fu

Publication date: 23 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

hypercubelinear codescoding theorycoloring problem\(\mathbb Z_4\)-linear codesforbidden distance codes

Mathematics Subject Classification ID

Hypergraphs (05C65) Linear codes (general theory) (94B05) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (4)

Distance colorings of hypercubes from \(\mathbb{Z}_2 \mathbb{Z}_4\)-linear codes ⋮ Exact distance graphs of product graphs ⋮ On the acyclic chromatic number of Hamming graphs ⋮ Two coloring problems on matrix graphs

Uses Software

• Code Tables

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a hypercube coloring problem
• BCH codes and distance multi- or fractional colorings in hypercubes asymptotically
• A distance-labelling problem for hypercubes
• On the acyclic chromatic number of Hamming graphs
• Codes with given distances
• Orthogonal vectors in the \(n\)-dimensional cube and codes with missing distances
• 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.
• Codes with forbidden distances
• Matroidal bijections between graphs
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• Some maximum multigraphs and adge/vertex distance colourings

This page was built for publication: New results on two hypercube coloring problems