Coloring Cycle Decompositions in Complete Graphs on a Prime Number of Vertices
Initializing live version
Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
Complete graphs on a prime number of vertices can be quickly decomposed into cycles. This Demonstration allows you to choose a complete graph on a prime number of vertices and choose a color scheme for the resulting cycle decomposition.
Contributed by: Michael Morrison (October 2008)
Open content licensed under CC BY-NC-SA
Snapshots
Details
detailSectionParagraph
Related Demonstrations
More by Author
Beraha's Conjecture, Wheels, and Cyclic Graphs
Jacqueline Zizi
Prime Factorization Graph
Emmanuel Garces Medina
Prime-Generating Recurrence
Eric Rowland
Gaps between Successive Primes
Daniel de Souza Carvalho
Fermat's Little Theorem
Michael Schreiber
Copeland-Erdos and Champernowne Numbers for Small Bases
Michael Schreiber
Networks for Basic Number Theoretic Functions
George Beck
Prime Number Races
Michael Trott
De Bruijn Graph Arcs
Michael Schreiber
Relatively Prime Numbers and Zeta(2)
Okay Arik
