The following pages link to On a hypercube coloring problem (Q703683):
Displayed 16 items.
- The \(b\)-chromatic number of powers of hypercube (Q327695) (← links)
- Distance three labelings of trees (Q415278) (← links)
- Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs (Q432716) (← links)
- Distance colorings of hypercubes from \(\mathbb{Z}_2 \mathbb{Z}_4\)-linear codes (Q516839) (← links)
- On \(b\)-coloring of powers of hypercubes (Q528557) (← links)
- The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes (Q765320) (← links)
- BCH codes and distance multi- or fractional colorings in hypercubes asymptotically (Q868374) (← links)
- A distance-labelling problem for hypercubes (Q1005224) (← links)
- On the acyclic chromatic number of Hamming graphs (Q1014824) (← links)
- Graph 2-rankings (Q1733856) (← links)
- On transitive uniform partitions of \(F^n\) into binary Hamming codes (Q2323137) (← links)
- On coupon colorings of graphs (Q2354722) (← links)
- On the complexity of restoring corrupted colorings (Q2424718) (← links)
- New results on two hypercube coloring problems (Q2446885) (← links)
- Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey (Q3439628) (← links)
- The chromatic number of the square of the $8$-cube (Q4640334) (← links)