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.

• Gödel's Incompleteness Theorem
• Haar Function
• Haar Integral
• Haar Measure
• Haar Transform
• Haberdasher's Problem
• Hadamard Design
• Hadamard Matrix
• Hadamard's Inequality
• Hadamard's Theorem
• Hadamard Transform
• Hadamard-Vallée Poussin Constants
• Hadwiger Problem
• Hadwiger's Principal Theorem
• Hafner-Sarnak-McCurley Constant
• Hahn-Banach Theorem
• Hailstone Number
• Hairy Ball Theorem
• Half
• Half-Closed Interval
• Half-Normal Distribution
• Half-Open Interval
• Halley's Irrational Formula
• Halley's Method
• Halley's Rational Formula