Faculty Advisor

Christopher, Peter R.

Faculty Advisor

Selkow, Stanley M.

Abstract

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.

Publisher

Worcester Polytechnic Institute

Date Accepted

December 2009

Major

Computer Science

Major

Mathematical Sciences

Project Type

Major Qualifying Project

Accessibility

Unrestricted

Advisor Department

Mathematical Sciences

Advisor Department

Computer Science

Share

COinS