
|
![]()
|
||||||||||||||||||||||||

TOPICS![]()
This page:
About Levels of Difficulty
Discrete Math
Browse all PoW Library
|
Vertex-coloring problems are a part of graph theory, and are sometimes referred to as graph-coloring problems. Vertex coloring is commonly used to solve scheduling problems and conflict problems. Both of these applications can be found in the problems listed below. For background information elsewhere on our site, explore the High School Discrete Math area of the Ask Dr. Math archives. To find relevant sites on the Web, browse and search Discrete Mathematics in our Internet Mathematics Library. Access to these problems requires a Membership. |
[Privacy Policy] [Terms of Use]

Home || The Math Library || Quick Reference || Search || Help

The Math Forum is a research and educational enterprise of the Drexel University School of Education.