A coloring problem in Hamming spaces

DOI10.1006/eujc.1996.0093zbMath0880.05033OpenAlexW2025879825MaRDI QIDQ1357659

Patric R. J. Östergård

Publication date: 20 July 1997

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1996.0093

zbMATH Keywords

Hamming distanceR-domatic numberR-dominating set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Bounds on codes (94B65) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

On identifying codes that are robust against edge changes ⋮ New upper bounds for binary covering codes ⋮ On a hypercube coloring problem

This page was built for publication: A coloring problem in Hamming spaces