Title

Infinite Families of Subgraphs in Coloring Graphs

Poster Number

33

Lead Author Major

Applied Mathematics

Format

Poster Presentation

Faculty Mentor Name

Larry Langley

Faculty Mentor Department

Mathematics

Abstract/Artist Statement

The k-coloring graph of G is de fined as the graph whose vertex set is all the proper kcolorings of G with edges between colorings if and only if they diff er at precisely one vertex of G. Our research seeks to determine properties that indicate whether a graph is realizable as a coloring graph. In our approach we identify graphs that are not coloring graphs by locating minimally forbidden induced subgraphs, graphs that cannot be an induced subgraph of any coloring graph. This paper will discuss a new in finite family of minimally forbidden induced subgraphs we found. We also examine the formation of edge labeling templates, a new technique we implemented in our research.

Location

DeRosa University Center, Ballroom

Start Date

30-4-2016 1:30 AM

End Date

30-4-2016 3:30 PM

This document is currently not available here.

Share

COinS
 
Apr 30th, 1:30 AM Apr 30th, 3:30 PM

Infinite Families of Subgraphs in Coloring Graphs

DeRosa University Center, Ballroom

The k-coloring graph of G is de fined as the graph whose vertex set is all the proper kcolorings of G with edges between colorings if and only if they diff er at precisely one vertex of G. Our research seeks to determine properties that indicate whether a graph is realizable as a coloring graph. In our approach we identify graphs that are not coloring graphs by locating minimally forbidden induced subgraphs, graphs that cannot be an induced subgraph of any coloring graph. This paper will discuss a new in finite family of minimally forbidden induced subgraphs we found. We also examine the formation of edge labeling templates, a new technique we implemented in our research.