Coloring the Platonic Solids

DOI10.2307/2323682MaRDI QIDQ3743322zbMATH OpenOpenAlexFDO

Authors D. H. Lehmer

Publication date 1986

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2323682

zbMATH Keywords

chromatic polynomialedge reductionPlatonic solids

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30)

Recommendations

• On (k,l)-chromatic edge colorings of Platonic solids
• Some algebraic methods for calculating the number of colorings of a graph
• Polynomial of coloring the graph
• Perfect 2-colorings of the Platonic graphs
• scientific article; zbMATH DE number 205347

Cited in

(10)

• A bibliography on chromatic polynomials
• A colouring problem for the dodecahedral graph
• Making triangles colorful
• On (k,l)-chromatic edge colorings of Platonic solids
• Colorful polytopes and graphs
• scientific article; zbMATH DE number 4108795 (Why is no real title available?)
• scientific article; zbMATH DE number 2039297 (Why is no real title available?)
• scientific article; zbMATH DE number 2039304 (Why is no real title available?)
• scientific article; zbMATH DE number 7564271 (Why is no real title available?)
• Quadratically Many Colorful Simplices

This page was built for publication: Coloring the Platonic Solids

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