Coloring of Graphs Avoiding Bicolored Paths of a Fixed Length

Alaittin Kırtışoğlu, Lale Özkahya

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 wel…