Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar Graphs

Pascal Ochem, Alexandre Pinlou, Sagnik Sen · Journal of Graph Theory · 2016

Abstract In this article, we introduce and study the properties of some target graphs for 2‐edge‐colored homomorphism. Using these properties, we obtain in particular that the 2‐edge‐colored chromatic number of the class of triangle‐free planar graphs is at most 50. We also show that it is at least 12.

Read the paper · More papers on PaperTik