Bounds on vertex colorings with restrictions on the union of color classes

A proper coloring of a graph is a labeled partition of its vertices into parts which are independent sets. In this paper, given a positive integer j and a family ℱ of connected graphs, we consider proper colorings in which we require that the union of any j color classes induces a subgraph which has no copy of any member of ℱ. This generalizes some well-known types of proper colorings like acyclic colorings (where j = 2 and ℱis the collection of all even cycles) and star colorings (where j = 2 and ℱconsists of just a path on 4 vertices), etc. For this type of coloring, we obtain an upper bound of O(d(k − 1)/(k − j)) on the minimum number of colors sufficient to obtain such a coloring. Here, d refers to the maximum degree of the graph and k is the size of the smallest member of ℱ. For the case of j = 2, we also obtain lower bounds on the minimum number of colors needed in the worst case. As a corollary, we obtain bounds on the minimum number of colors sufficient to obtain proper colorings in which the union of any j color classes is a graph of bounded treewidth. In particular, using O(d8/7) colors, one can obtain a proper coloring of the vertices of a graph so that the union of any two color classes has treewidth at most 2. We also show that this bound is tight within a multiplicative factor of O((logd)1/7). We also consider generalizations where we require simultaneously for several pairs (ji, ℱi) (i = 1, …, l) that the union of any ji color classes has no copy of any member of ℱi and obtain upper bounds on the corresponding chromatic numbers. © 2011 Wiley Periodicals, Inc. J Graph Theory 66: 213–234, 2011 © 2011 Wiley Periodicals, Inc.

[1]  B. Grünbaum.  Acyclic colorings of planar graphs , 1973 .

[2]  Bruce A. Reed,et al.  Excluding any graph as a minor allows a low tree-width 2-coloring , 2004, J. Comb. Theory, Ser. B.

[3]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[4]  Jaroslav Nesetril,et al.  Tree-depth, subgraph coloring and homomorphism bounds , 2006, Eur. J. Comb..

[5]  Paul G. Spirakis,et al.  Radiocoloring in planar graphs: Complexity and approximations , 2005, Theor. Comput. Sci..

[6]  C. R. Subramanian,et al.  Forbidden subgraph colorings and the oriented chromatic number , 2009, Eur. J. Comb..

[7]  Bruce A. Reed,et al.  Colouring a graph frugally , 1997, Comb..

[8]  P. Erdos-L Lovász.  Problems and Results on 3-chromatic Hypergraphs and Some Related Questions , 2022 .

[9]  Nicholas C. Wormald,et al.  The acyclic edge chromatic number of a random d-regular graph is d + 1 , 2005 .

[10]  Béla Bollobás,et al.  Random Graphs , 1985 .

[11]  Robin Thomas,et al.  Graph Searching and a Min-Max Theorem for Tree-Width , 1993, J. Comb. Theory, Ser. B.

[12]  L. Lovasz.  Discrete mathematics : elementary and beyond / by L. Lovasz, J. Pelikan, K. Vesztergombi , 2004 .

[13]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[14]  Bruce A. Reed,et al.  Acyclic Coloring of Graphs , 1991, Random Struct. Algorithms.

[15]  C. R. Subramanian.  Analysis of a heuristic for acyclic edge colouring , 2006, Inf. Process. Lett..

[16]  D. West.  Introduction to Graph Theory , 1995 .

[17]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[18]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[19]  Xuding Zhu,et al.  Colouring graphs with bounded generalized colouring number , 2009, Discret. Math..

[20]  Nicholas C. Wormald,et al.  The generalized acyclic edge chromatic number of random regular graphs , 2006 .

[21]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[22]  Bruce A. Reed,et al.  Star coloring of graphs , 2004, J. Graph Theory.

[23]  Paul D. Seymour,et al.  Graph minors. X. Obstructions to tree-decomposition , 1991, J. Comb. Theory, Ser. B.

[24]  Charles J. Colbourn,et al.  Steiner trees, partial 2-trees, and minimum IFI networks , 1983, Networks.

[25]  C. R. Subramanian,et al.  Bounds on Edge Colorings with Restrictions on the Union of Color Classes , 2010, SIAM J. Discret. Math..