Author

Xin Yutong

Date of Award

2020

Document Type

Thesis

First Advisor

Dr. Prateek Bhakta

Abstract

Reconfiguration problems have been studied and applied to solve problems in various areas, including Math, Computer Science, and Chemistry. Due to the close relatedness between coloring graphs and reconfiguration problems, the connectivity and structure of coloring graphs give valuable information to a solution set of the corresponding reconfiguration problem. In this paper we will discuss 2--connectedness and cut-vertices of coloring graphs, and forbidden structures on a coloring graph wit cut-vertices.

Share

COinS