Effective on-line coloring of P5-free graphs

András Gyárfás, Jeno Lehel

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

An on-line algorithm is given that colors any P5-free graph with f(ω) colors, where f is a function of the clique number ω of the graph.

Original languageEnglish
Pages (from-to)181-184
Number of pages4
JournalCombinatorica
Volume11
Issue number2
DOIs
Publication statusPublished - Jun 1 1991

Keywords

  • AMS subject classification code (1991): 05C85

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Effective on-line coloring of P<sub>5</sub>-free graphs'. Together they form a unique fingerprint.

  • Cite this