论文信息 - Effective on-line coloring ofP5-free graphs - 字舞流文

Effective on-line coloring ofP5-free graphs

An on-line algorithm is given that colors anyP5-free graph withf(ω) colors, wheref is a function of the clique number ω of the graph.

András Gyárfás | Jenö Lehel

[1] A. Gyárfás. Problems from the world surrounding perfect graphs , 1987 .

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

[3] Michael E. Saks,et al. An on-line graph coloring algorithm with sublinear performance ratio , 1989, Discret. Math..

[4] H. A. Kierstead,et al. The Linearity of First-Fit Coloring of Interval Graphs , 1988, SIAM J. Discret. Math..