Difference between revisions of "GraphColoring"
Jump to navigation
Jump to search
| Line 6: | Line 6: | ||
== Blank Graphs == | == Blank Graphs == | ||
| − | |||
* [[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:random50_10.pdf|Random graph with 50 nodes]] | * [[Media:random50_10.pdf|Random graph with 50 nodes]] | ||
| − | * [[Media: | + | * [[Media:grid9x7.pdf| Grid graph with 9x7 grid for distance-two coloring]] |
| − | * [[Media: | + | * [[Media:grid11x11.pdf| Grid graph with 11x11 grid for distance-two coloring]] |
== Presentation == | == Presentation == | ||
* [[Media:GraphColoring.pdf|Graph Coloring, by Paul Hovland, Sven Leyffer, and Krishna Narayanan, MCS Division, Argonne National Laboratory, 2016]] | * [[Media:GraphColoring.pdf|Graph Coloring, by Paul Hovland, Sven Leyffer, and Krishna Narayanan, MCS Division, Argonne National Laboratory, 2016]] | ||
Revision as of 09:45, 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 50 nodes
- Grid graph with 9x7 grid for distance-two coloring
- Grid graph with 11x11 grid for distance-two coloring