Coloring the Platonic Solids

DOI10.2307/2323682zbMATH Open0605.05011OpenAlexW4252649134MaRDI QIDQ3743322FDOQ3743322

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

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

zbMATH Keywords

chromatic polynomialPlatonic solidsedge reduction

Mathematics Subject Classification ID

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

Cited In (10)

• Making triangles colorful
• Title not available (Why is that?)
• On \((k,l)\)-chromatic edge colorings of Platonic solids
• A bibliography on chromatic polynomials
• Title not available (Why is that?)
• A colouring problem for the dodecahedral graph
• Title not available (Why is that?)
• Quadratically Many Colorful Simplices
• Title not available (Why is that?)
• Colorful polytopes and graphs

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)