Coloring subgraphs with restricted amounts of hues

Abstract We consider vertex colorings where the number of colors given to specified subgraphs is restricted. In particular, given some fixed graph F and some fixed set A of positive integers, we consider (not necessarily proper) colorings of the vertices of a graph G such that, for every copy of F in G, the number of colors it receives is in A. This generalizes proper colorings, defective coloring, and no-rainbow coloring, inter alia. In this paper we focus on the case that A is a singleton set. In particular, we investigate the colorings where the graph F is a star or is 1-regular.

[1]  A. V. Kostochkaa,et al.  On domination in connected cubic graphs , 2005 .

[2]  Vitaly I. Voloshin,et al.  On the upper chromatic number of a hypergraph , 1995, Australas. J Comb..

[3]  A. Hajnal,et al.  On decomposition of graphs , 1967 .

[4]  Fan Chung,et al.  On the Decomposition of Graphs , 1981 .

[5]  Csilla Bujtás,et al.  K3-Worm Colorings of Graphs: Lower Chromatic Number and Gaps in the Chromatic Spectrum , 2016, Discuss. Math. Graph Theory.

[6]  Csilla Bujtás,et al.  3-consecutive C-colorings of graphs , 2010, Discuss. Math. Graph Theory.

[7]  Noga Alon,et al.  Partitioning into graphs with only small components , 2003, J. Comb. Theory, Ser. B.

[8]  Zsolt Tuza,et al.  Problems and Results on Colorings of Mixed Hypergraphs , 2008 .

[9]  Wayne Goddard,et al.  Worm Colorings , 2015, Discuss. Math. Graph Theory.

[10]  Csilla Bujtás,et al.  Vertex coloring without large polychromatic stars , 2012, Discret. Math..

[11]  Marietjie Frick,et al.  A survey of hereditary properties of graphs , 1997, Discuss. Math. Graph Theory.

[12]  Wayne Goddard,et al.  Vertex Colorings without Rainbow Subgraphs , 2016, Discuss. Math. Graph Theory.

[13]  Wayne Goddard,et al.  Defective coloring revisited , 1997, J. Graph Theory.