Thursday, April 28 2022

9:00am - 10:30am

9:00am - 10:30am

PhD Thesis Presentation

Variations of Edge Colorings on Planar Graphs

Given a graph, we can assign colors to the edges of the graph following certain properties. A star edge coloring of a graph is a proper coloring of the edges such that there are no bicolored cycles of length 4 or paths of length 4. The star chromatic index of a graph G, $\chi_{st}'(G)$, is the smallest number of colors needed to give a star edge coloring of G. A strong edge coloring is a coloring of the edges such that edges that are at most distance 2 from each other must receive different colors. The strong chromatic index, $\chi_s'(G)$, is the minimum number of colors needed for a strong edge coloring. We propose examining some open problems regarding bounds on the star chromatic index and strong chromatic index, as well as their list versions, for some planar graphs.

Speaker: | Rebecca Robinson |

Affiliation: | |

Location: | Zoom link in email |

Done