This project involved pulling together past work on the achromatic and first-fit chromatic numbers, as well as a description of a proof by Yegnanarayanan et al. Our work includes attempting to find patterns for them in specific classes of graphs and the beginnings of an attempt to prove that for any given a, b, c, such that 2 <= a <= b <= c, there exists a graph with chromatic number a, first-fit chromatic number b, and achromatic number c.

• This report represents the work of one or more WPI undergraduate students submitted to the faculty as evidence of completion of a degree requirement. WPI routinely publishes these reports on its website without editorial or peer review.

Creator

• Fuller, Stephanie Jenna

Publisher

• Worcester Polytechnic Institute

Identifier

• E-project-122109-160954

Advisor

• Christopher, Peter R.
• Selkow, Stanley M.

Year

• 2009

Date created

• 2009-12-21

Resource type

• Major Qualifying Project

Major

• Interdisciplinary

Rights statement

• In Copyright