Edge-Coloring
An edge-coloring of a Graph 
is a coloring of the edges of such that adjacent edges (orthe edges bounding different regions) receive different colors. Brelaz's Heuristic Algorithm can be used to find a good,but not necessarily minimal, edge-coloring.
References
Saaty, T. L. and Kainen, P. C. The Four-Color Problem: Assaults and Conquest. New York: Dover, p. 13, 1986.
- Gram Series
- Gram's Inequality
- Granny Knot
- Graph (Function)
- Graph (Graph Theory)
- Graphical Partition
- Graph Theory
- Graph Two-Coloring
- Grassmann Algebra
- Grassmann Coordinates
- Grassmann Manifold
- Gray Code
- Great Circle
- Great Cubicuboctahedron
- Great Deltoidal Hexecontahedron
- Great Deltoidal Icositetrahedron
- Great Dirhombicosidodecacron
- Great Dirhombicosidodecahedron
- Great Disdyakis Dodecahedron
- Great Disdyakis Triacontahedron
- Great Ditrigonal Dodecacronic Hexecontahedron
- Great Ditrigonal Dodecicosidodecahedron
- Great Ditrigonal Icosidodecahedron
- Great Dodecacronic Hexecontahedron
- Great Dodecadodecahedron