Other
Elmwood Park High School: Vertex Edge Graphs
In this Unit, you will use vertex-edge graphs and Euler Circuits to help find optimum paths. Included are two lessons that help you develop the understanding and skill needed to solve problems about optimum paths and conflicts.
Cornell University
Cornell University: Counting Solution Clusters in Graph Coloring Problems
This paper proposes one of the first scalable methods for estimating the number of clusters of solutions of graph coloring problems using a belief propagation like algorithm.
Other
Geeks for Geeks: Graph Coloring|set 2 (Greedy Algorithm)
Graph coloring is widely used. Unfortunately, there is no efficient algorithm available for coloring a graph with a minimum number of colors as the problem is a known NP-Complete problem. There are approximate algorithms to solve the...
Other
Tutorials Point: Graph Theory Coloring
Graph coloring is nothing but a simple way of labeling graph components such as vertices, edges, and regions under some constraints. This site introduces you to graph coloring and its applications in the real world.
Other
Geeks for Geeks: Graph Coloring|set 1 (Introduction and Applications)
Graph coloring problem is to assign colors to certain elements of a graph subject to certain constraints. This source looks at different applications of graph coloring.
Wolfram Research
Wolfram Math World: Edge Coloring
This site displays a description and diagrams dealing with edge coloring.
Wolfram Research
Wolfram Math World: Vertex Coloring
You will find a definition and diagrams dealing with vertex coloring.
