Pages that link to "Item:Q1570845"

The following pages link to A coloring problem on the \(n\)-cube (Q1570845):

Displaying 22 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)
• Acyclic and \(k\)-distance coloring of the grid (Q1014392) (← links)
• Silver cubes (Q1014825) (← links)
• New bounds on a hypercube coloring problem. (Q1853150) (← links)
• A channel assignment problem for optical networks modelled by Cayley graphs (Q1884990) (← links)
• An optimal square coloring of planar graphs (Q1928491) (← links)
• The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748) (← links)
• Distance-constrained labellings of Cartesian products of graphs (Q2231783) (← links)
• The clique distribution in powers of hypercubes (Q2235258) (← links)
• On coupon colorings of graphs (Q2354722) (← 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)