Bounds for Cube Coloring

DOI10.1137/0606008MaRDI QIDQ3221409zbMATH OpenOpenAlexFDO

Authors Barton R. Plumstead, Joan B. Plumstead

Publication date 1985

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0606008

zbMATH Keywords

Boolean circuitbranching programscoloring algorithmlower boundprograms for n-cube coloringupper bound

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Recommendations

• A coloring problem on the \(n\)-cube
• On dissections of the n-cube
• How robust is the n-cube?
• scientific article; zbMATH DE number 146671
• scientific article; zbMATH DE number 3937107

Cited in

(4)

• The linzertorte problem, or a unified approach to painting, baking and weaving
• Finding the Rare Cube
• scientific article; zbMATH DE number 3937107 (Why is no real title available?)
• Balancing the \(n\)-cube: A census of colorings

This page was built for publication: Bounds for Cube Coloring

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