On a coloring problem on the n-cube

MaRDI QIDQ3620650zbMATH OpenFDO

Authors Lane Clark

Publication date 14 April 2009

zbMATH Keywords

\(n\)-cubedistance in graphsgeneralized chromatic number

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

Recommendations

• A coloring problem on the \(n\)-cube
• On a hypercube coloring problem
• New bounds on a hypercube coloring problem.
• Polychromatic vertex coloring of cube graphs
• New results on two hypercube coloring problems

Cited in

(12)

• On robust colorings of Hamming-distance graphs
• The chromatic number of the square of the 8-cube
• Minimum neighborhood in a generalized cube
• New results on two hypercube coloring problems
• On \(b\)-coloring of powers of hypercubes
• scientific article; zbMATH DE number 1923049 (Why is no real title available?)
• On a hypercube coloring problem
• Polychromatic vertex coloring of cube graphs
• On the chromatic number of cube-like graphs
• A coloring problem on the \(n\)-cube
• New bounds on a hypercube coloring problem.
• On the distance chromatic number of Hamming graphs

This page was built for publication: On a coloring problem on the \(n\)-cube

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