Abstract | ||
---|---|---|
Signed graphs are studied since the middle of the last century. Recently, the notion of homomorphism of signed graphs has been introduced since this notion captures a number of well known conjectures which can be reformulated using the definitions of signed homomorphism. In this paper, we introduce and study the properties of some target graphs for signed homomorphism. Using these properties, we obtain upper bounds on the signed chromatic numbers of graphs with bounded acyclic chromatic number and of signed planar graphs with given girth. |
Year | Venue | Field |
---|---|---|
2014 | CoRR | Graph,Discrete mathematics,Indifference graph,Combinatorics,Chromatic scale,Chordal graph,Homomorphism,Mathematics,Planar graph,Bounded function |
DocType | Volume | Citations |
Journal | abs/1401.3308 | 4 |
PageRank | References | Authors |
0.47 | 0 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Pascal Ochem | 1 | 258 | 36.91 |
Alexandre Pinlou | 2 | 167 | 20.47 |
Sagnik Sen | 3 | 21 | 13.13 |