Skip to main content
Log in

Effective on-line coloring ofP 5-free graphs

  • Note
  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

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

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. A. Gyárfás: Problems from the world surrounding perfect graphs,Zastosowania Matematyki Applicationes Mathemaicae XIX.3–4 (1987), 413–441.

    Google Scholar 

  2. A. Gyárfás, andJenő Lehel: On-line and first fit colorings of graphs,Journal of Graph Theory,12 (1988) 217–227.

    Google Scholar 

  3. A. Gyárfás, andJenő Lehel: First fit and on-line chromatic number of families of graphs,Ars Combinatoria,29 B (1990).

  4. H. A. Kierstead: The linearity of First-Fit coloring of interval graphs, preprint, 1988.

  5. L. Lovász, M. Saks, andW. T. Trotter: An on-line graph coloring algorithm with sublinear performance ration,Discrete Math.,75, (1989) 319–325.

    Google Scholar 

  6. D. P. Sumner: Subtrees of a graph and the chromatic number, in: Theory and Applications of Graphs (ed. G. Chartrand), 1981, 557–576.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gyárfás, A., Lehel, J. Effective on-line coloring ofP 5-free graphs. Combinatorica 11, 181–184 (1991). https://doi.org/10.1007/BF01206361

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01206361

AMS subject classification code (1991)

Navigation