Geodesic
Vertex Colorings without Rainbow Subgraphs
Discussiones Mathematicae. Graph Theory, Tome 36 (2016) no. 4, pp. 989-1005.

Voir la notice de l'article provenant de la source Library of Science

Given a coloring of the vertices of a graph G, we say a subgraph is rainbow if its vertices receive distinct colors. For a graph F, we define the F-upper chromatic number of G as the maximum number of colors that can be used to color the vertices of G such that there is no rainbow copy of F. We present some results on this parameter for certain graph classes. The focus is on the case that F is a star or triangle. For example, we show that the K3-upper chromatic number of any maximal outerplanar graph on n vertices is [n/2] + 1.
Keywords: coloring, rainbow, monochromatic, forbidden, path 
@article{DMGT_2016_36_4_a15,
     author = {Goddard, Wayne and Xu, Honghai},
     title = {Vertex {Colorings} without {Rainbow} {Subgraphs}},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {989--1005},
     publisher = {mathdoc},
     volume = {36},
     number = {4},
     year = {2016},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2016_36_4_a15/}
}
TY  - JOUR
AU  - Goddard, Wayne
AU  - Xu, Honghai
TI  - Vertex Colorings without Rainbow Subgraphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2016
SP  - 989
EP  - 1005
VL  - 36
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2016_36_4_a15/
LA  - en
ID  - DMGT_2016_36_4_a15
ER  - 
%0 Journal Article
%A Goddard, Wayne
%A Xu, Honghai
%T Vertex Colorings without Rainbow Subgraphs
%J Discussiones Mathematicae. Graph Theory
%D 2016
%P 989-1005
%V 36
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2016_36_4_a15/
%G en
%F DMGT_2016_36_4_a15
Goddard, Wayne; Xu, Honghai. Vertex Colorings without Rainbow Subgraphs. Discussiones Mathematicae. Graph Theory, Tome 36 (2016) no. 4, pp. 989-1005. http://geodesic.mathdoc.fr/item/DMGT_2016_36_4_a15/

[1] M. Axenovich and R. Martin, Avoiding rainbow induced subgraphs in vertexcolorings, Electron. J. Combin. 15 (2008) #R12.

[2] Cs. Bujtás, E. Sampathkumar, Zs. Tuza, C. Dominic and L. Pushpalatha, Vertex coloring without large polychromatic stars, Discrete Math. 312 (2012) 2102-2108. doi: 10.1016/j.disc.2011.04.013

[3] Cs. Bujtás, E. Sampathkumar, Zs. Tuza, M.S. Subramanya and C. Dominic, 3- consecutive C-colorings of graphs, Discuss. Math. Graph Theory 30 (2010) 393-405. doi: 10.7151/dmgt.1502

[4] Y. Caro and J. Lauri, Non-monochromatic non-rainbow colourings of _-hypergraphs, Discrete Math. 318 (2014) 96-104. doi: 10.1016/j.disc.2013.11.016

[5] Z. Dvořák, D. Král and R. Škrekovski, Non-rainbow colorings of 3-, 4- and 5-connected plane graphs, J. Graph Theory 63 (2010) 129-145. doi: 10.1002/jgt.20414

[6] O. Favaron, Signed domination in regular graphs, Discrete Math. 158 (1996) 287-293. doi: 10.1016/0012-365X(96)00026-X

[7] S. Fujita, C. Magnant and K. Ozeki, Rainbow generalizations of Ramsey theory: a survey, Graphs Combin. 26 (2010) 1-30. doi: 10.1007/s00373-010-0891-3

[8] W. Goddard, K. Wash and H. Xu, WORM colorings, Discuss. Math. Graph Theory 35 (2015) 571-584. doi: 10.7151/dmgt.1814

[9] W. Goddard, K. Wash and H. Xu, WORM colorings forbidding cycles or cliques, Congr. Numer. 219 (2014) 161-173.

[10] A. Gyárfás, G.N. Sárközy, A. Sebö and S. Selkow, Ramsey-type results for Gallai colorings, J. Graph Theory 64 (2010) 233-243. doi: 10.1002/jgt.20452

[11] A. Gyárfás and G. Simony, Edge colorings of complete graphs without tricolored triangles, J. Graph Theory 46 (2004) 211-216. doi: 10.1002/jgt.20001

[12] A. Kisielewicz and M. Szyku la, Rainbow induced subgraphs in proper vertex colorings, Fund. Inform. 111 (2011) 437-451.

[13] R. Ramamurthi and D.B.West, Maximum face-constrained coloring of plane graphs, Discrete Math. 274 (2004) 233-240. doi: 10.1016/j.disc.2003.09.001

[14] V. Voloshin, On the upper chromatic number of a hypergraph, Australas. J. Combin.11 (1995) 25-45.