Packing coloring of hypercubes with extended Hamming codes

DOI10.1016/J.DAM.2024.07.048MaRDI QIDQ6633542

Kenny Štorgel, Borut Lužar, Petr Gregor, Jaka Kranjc

Publication date: 6 November 2024

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

zbMATH Keywords

hypercubeHamming codepacking chromatic numberpacking \(k\)-coloring

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The packing chromatic number of infinite product graphs
• An infinite family of subcubic graphs with unbounded packing chromatic number
• Packing chromatic number of cubic graphs
• On the packing chromatic number of subcubic outerplanar graphs
• Packing chromatic number of subdivisions of cubic graphs
• A survey on packing colorings
• Packing colorings of subcubic outerplanar graphs
• The packing chromatic number of hypercubes
• A table of upper bounds for binary codes
• Error Detecting and Error Correcting Codes
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
• The packing chromatic number of the infinite square grid is 15

This page was built for publication: Packing coloring of hypercubes with extended Hamming codes

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