Premium
Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar Graphs
Author(s) -
Ochem Pascal,
Pinlou Alexandre,
Sen Sagnik
Publication year - 2017
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.22059
Subject(s) - colored , mathematics , combinatorics , homomorphism , chromatic scale , planar graph , enhanced data rates for gsm evolution , 1 planar graph , edge coloring , class (philosophy) , planar , discrete mathematics , chordal graph , graph , computer science , line graph , telecommunications , graph power , materials science , computer graphics (images) , artificial intelligence , composite material
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.