Restricted coloring problems on Graphs with few P4’s

Abstract In this paper, we obtain polynomial time algorithms to determine the acyclic chromatic number, the star chromatic number and the harmonious chromatic number of P 4 -tidy graphs and ( q , q − 4 )-graphs, for every fixed q. These classes include cographs, P 4 -sparse and P 4 -lite graphs. We also obtain a polynomial time algorithm to determine the Grundy number of ( q , q − 4 )-graphs. All these coloring problems are known to be NP-hard for general graphs.

[1]  András Gyárfás,et al.  On-line and first fit colorings of graphs , 1988, J. Graph Theory.

[2]  Vassilis Giakoumakis,et al.  On P4-tidy graphs , 1997, Discrete Mathematics & Theoretical Computer Science.

[3]  Stephan Olariu,et al.  On the Structure of Graphs with Few P4s , 1998, Discret. Appl. Math..

[4]  Frank Harary,et al.  Graph Theory , 2016 .

[5]  Hans L. Bodlaender,et al.  Achromatic Number is NP-Complete for Cographs and Interval Graphs , 1989, Inf. Process. Lett..

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

[7]  Manouchehr Zaker,et al.  Grundy chromatic number of the complement of bipartite graphs , 2005, Australas. J Comb..

[8]  Katerina Asdre,et al.  The harmonious coloring problem is NP-complete for interval and permutation graphs , 2007, Discret. Appl. Math..

[9]  Vassilis Giakoumakis,et al.  On P 4 -tidy graphs , 1997 .

[10]  Stephan Olariu,et al.  Efficient algorithms for graphs with few P4's , 2001, Discret. Math..

[11]  Glenn G. Chappell,et al.  Coloring with no 2-Colored P4's , 2004, Electron. J. Comb..

[12]  Andrew Lyons.  Acyclic and Star Colorings of Joins of Graphs and an Algorithm for Cographs (Extended Abstract) , 2009 .

[13]  Júlio Araújo,et al.  Grundy number on P4-classes , 2009, Electron. Notes Discret. Math..