Christopher, Peter R.
The project explores graph theory's star coloring parameter, [chi]s. This is a proper coloring where all paths of four vertices use at least three colors. We find a planar graph with [chi]s=10 on the smallest known number of vertices. We also find bounds on the sum of [chi]s of a graph and its complement. Additionally, we explore the parameter on permutation graphs, Mycielski graphs, and maximal planar graphs and their duals.
Worcester Polytechnic Institute
Major Qualifying Project
Access to this report is limited to members of the WPI community. Please contact a project advisor or their department to request access
Restricted-WPI community only