WOLFRAM MATERIALS for the ARTICLE:
Robert Cowen (2021).Mixing Numbers and Unfriendly Colorings of Graphs.The Mathematica Journal, 23.https://doi.org/10.3888/tmj.23-4Full article in PDF.
Robert Cowen (2021).
Mixing Numbers and Unfriendly Colorings of Graphs.
The Mathematica Journal, 23.
Full article in PDF.
The Mathematica language has a robust set of built-in functions for graph theory explorations. Many of them come from the old Combinatorica package developed by Steven Skiena. However there is not much that deals with graph coloring. Out of necessity, I have created my own functions and have recently published a paper in The Mathematica Journal and I am adding a notebook with additional material here. Hopefully this will be useful to researchers in graph theory and encourage others to develop additional useful material for those interested in graph theory coloring problems.
-- you have earned Featured Contributor Badge
Your exceptional post has been selected for our editorial column Staff Picks http://wolfr.am/StaffPicks and Your Profile is now distinguished by a Featured Contributor Badge and is displayed on the Featured Contributor Board. Thank you!
Thanks for this honor! I should also like to thank George Beck who was the editor for my Mathematica Journal articles and who has taught me much about the Mathematica programming language.
If you work with graphs and colourings in Mathematica, you may find the IGraph/M package interesting. It has had very competitive graph colouring functionality for many years now, and also provides most graph-related functionality from the old Combinatorica, but in a much more performant way.
PetersenGraph[VertexSize -> Large, EdgeStyle -> Thickness[0.05]] //
IGVertexMap[ColorData, VertexStyle -> IGMinimumVertexColoring] //
IGEdgeMap[ColorData, EdgeStyle -> IGMinimumEdgeColoring]