Description
Every graph can be colored with one more color than its maximum degree. A well-known theorem of Brooks gives the precise conditions under which a graph can be colored with maximum degree colors.
Copyright Statement
Download count: 0
Details
Contributors
- Rabern, Landon (Author)
- Kierstead, Henry (Thesis advisor)
- Colbourn, Charles (Committee member)
- Czygrinow, Andrzej (Committee member)
- Fishel, Susanna (Committee member)
- Hurlbert, Glenn (Committee member)
- Arizona State University (Publisher)
Date Created
The date the item was original created (prior to any relationship with the ASU Digital Repositories.)
2013
Resource Type
Collections this item is in
Note
- Partial requirement for: Ph.D., Arizona State University, 2013Note typethesis
- Includes bibliographical references (p. 166-171)Note typebibliography
- Field of study: Mathematics
Citation and reuse
Statement of Responsibility
by Landon Rabern