You are cordially invited to the Analysis Seminar organized by the Department of Mathematics.<\/p>\n
Speaker: Lale \u00d6zkahya Hacettepe University)<\/p>\n
\u201cColoring of Graphs Avoiding Bicolored Paths of a Fixed Length\u201d<\/p>\n
Abstract: The problem of finding the minimum number of colors to color a graph properly without containing any bicolored copy of a fixed family of subgraphs has been widely studied. Most well-known examples are star coloring and acyclic coloring of graphs (Gr\u00fcunbaum, 1973) where bicolored copies of P4 and cycles are not allowed, respectively. We introduce a variation of these problems and study proper coloring of graphs not containing a bicolored path of a fixed length and provide general bounds for all graphs. A Pk-coloring of an undirected graph G is a proper vertex coloring of G such that there is no bicolored copy of Pk in G; and the minimum number of colors needed for a Pk-coloring of G is called the Pk-chromatic number of G; denoted by sk(G). We found bounds on s_k(G) for all graphs. Moreover, we find the exact values for the Pk-chromatic number of the products of some cycles and paths for k = 5; 6. This is joint work with Alaittin K\u0131rt\u0131\u015fo\u011flu.<\/p>\n
Date: Thursday, March 24, 2022
\nTime: 18:00-19:00, GMT+3.<\/p>\n
This is an online seminar. To request the event link, please send a message to goncha@fen.bilkent.edu.tr<\/p>\n","protected":false},"excerpt":{"rendered":"
You are cordially invited to the Analysis Seminar organized by the Department of Mathematics. Speaker: Lale \u00d6zkahya Hacettepe University) \u201cColoring of Graphs Avoiding Bicolored Paths of a Fixed Length\u201d Abstract: The problem of finding the minimum number of colors to color a graph properly without containing any bicolored copy of [\u2026] <\/p>\n