Pages that link to "Item:Q1853150"

The following pages link to New bounds on a hypercube coloring problem. (Q1853150):

Displaying 17 items.

• The \(b\)-chromatic number of powers of hypercube (Q327695) (← links)
• Distance three labelings of trees (Q415278) (← 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)
• On a hypercube coloring problem (Q703683) (← 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)
• The \(L(h,1,1)\)-labelling problem for trees (Q976152) (← links)
• A distance-labelling problem for hypercubes (Q1005224) (← links)
• On the acyclic chromatic number of Hamming graphs (Q1014824) (← links)
• A coloring problem in Hamming spaces (Q1357659) (← links)
• A coloring problem on the \(n\)-cube (Q1570845) (← links)
• The robust coloring problem. (Q1812001) (← links)
• New results on two hypercube coloring problems (Q2446885) (← links)
• Two coloring problems on matrix graphs (Q2821120) (← 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)