Coloring Graphs On-line

@inproceedings{Kierstead1996ColoringGO,
  title={Coloring Graphs On-line},
  author={Hal A. Kierstead},
  booktitle={Online Algorithms},
  year={1996}
}

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 28 references

Recursive colorings of graphs

  • J. H. Schmerl
  • Canad. J. Math.,
  • 1980
Highly Influential
4 Excerpts

First-fit and on-line coloring of graphs which do not induce Ps

  • H. A. Kierstead, S. G. Peurice, W. T. Trotter
  • Siam Journal on Discrete Math.,
  • 1995
Highly Influential
9 Excerpts

Effective on-line coloring of Ps-free

  • A. Gys, J. Lehel
  • graphs. Combinatorica,
  • 1991
Highly Influential
5 Excerpts

Recent results on a conjecture of Gys163

  • H .A . Kierstead, S. G. Penrice
  • Congressus Numerantium,
  • 1990
Highly Influential
9 Excerpts

An extremal problem in recursive combinatorics

  • H. A. Kierstead, W. T. Trotter
  • Congressus Numerantium,
  • 1981
Highly Influential
8 Excerpts

Recursive colorings of highly recursive graphs

  • H .A . Kierstead
  • Canadian J. Math.,
  • 1981
Highly Influential
11 Excerpts

Similar Papers

Loading similar papers…