On a hypercube coloring problem

DOI10.1016/J.JCTA.2004.06.010zbMATH Open1061.05035OpenAlexW2021640907MaRDI QIDQ703683FDOQ703683

Authors: Patric R. J. Östergård 

Publication date: 11 January 2005

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2004.06.010

Recommendations

• New results on two hypercube coloring problems
• New bounds on a hypercube coloring problem.
• On a coloring problem on the \(n\)-cube
• A coloring problem on the \(n\)-cube
• BCH codes and distance multi- or fractional colorings in hypercubes asymptotically

zbMATH Keywords

hypercubechromatic numberbinary codevertex coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• 25 pretty graph colouring problems
• A coloring problem on the \(n\)-cube
• New bounds on a hypercube coloring problem.
• Matroidal bijections between graphs
• The triply shortened binary Hamming code is optimal
• Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
• Title not available (Why is that?)
• Unit sphere packings and coverings of the Hamming space
• A coloring problem in Hamming spaces

Cited In (28)

• BCH codes and distance multi- or fractional colorings in hypercubes asymptotically
• On transitive uniform partitions of \(F^n\) into binary Hamming codes
• Distance three labelings of trees
• Title not available (Why is that?)
• On robust colorings of Hamming-distance graphs
• Graph 2-rankings
• The chromatic number of the square of the 8-cube
• Title not available (Why is that?)
• On a coloring problem on the \(n\)-cube
• The number of 4-colorings of the Hamming cube
• On coupon colorings of graphs
• Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs
• The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes
• New results on two hypercube coloring problems
• The clique distribution in powers of hypercubes
• On the acyclic chromatic number of Hamming graphs
• The \(b\)-chromatic number of powers of hypercube
• A distance-labelling problem for hypercubes
• Packing coloring of hypercubes with extended Hamming codes
• On \(b\)-coloring of powers of hypercubes
• On a heterochromatic number for hypercubes
• Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
• A coloring problem on the \(n\)-cube
• New bounds on a hypercube coloring problem.
• BCH codes are good for distance multicolorings with radio frequencies in hypercubes asymptotically
• Distance colorings of hypercubes from \(\mathbb{Z}_2 \mathbb{Z}_4\)-linear codes
• On the distance chromatic number of Hamming graphs
• On the complexity of restoring corrupted colorings

This page was built for publication: On a hypercube coloring problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703683)