Difference between revisions of "GraphColoring"
Jump to navigation
Jump to search
| Line 8: | Line 8: | ||
* [[Media:graph6.pdf|Simple graph with six nodes]] | * [[Media:graph6.pdf|Simple graph with six nodes]] | ||
* [[Media:random18.pdf|Random graph with 18 nodes]] | * [[Media:random18.pdf|Random graph with 18 nodes]] | ||
| + | * [[Media:random19.pdf|Random graph with 19 nodes]] | ||
| + | * [[Media:random20.pdf|Random graph with 20 nodes]] | ||
| + | * [[Media:random30.pdf|Random graph with 30 nodes]] | ||
* [[Media:random50_10.pdf|Random graph with 50 nodes]] | * [[Media:random50_10.pdf|Random graph with 50 nodes]] | ||
* [[Media:grid9x7.pdf| Grid graph with 9x7 grid for distance-two coloring]] | * [[Media:grid9x7.pdf| Grid graph with 9x7 grid for distance-two coloring]] | ||
Latest revision as of 09:47, 23 May 2016
Temporary page with graph coloring examples from 2016 Argonne Open House. All graphs were created by Paul Hovland, Senior Computer Scientist, Argonne National Laboratory.
Instructions
Blank Graphs
- Simple graph with six nodes
- Random graph with 18 nodes
- Random graph with 19 nodes
- Random graph with 20 nodes
- Random graph with 30 nodes
- Random graph with 50 nodes
- Grid graph with 9x7 grid for distance-two coloring
- Grid graph with 11x11 grid for distance-two coloring