Author:
Kierstead H. A.,Kolossa K.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference11 articles.
1. D. Bean: Effective coloration,J. Symbolic Logic 41 (1976), 469?480.
2. A. Gyárfás, andJ. Lehel: On-line and first-fit coloring of graphs,J. of Graph Theory 12 (1988), 217?227.
3. A. Gyárfás, andJ. Lehel: First-Fit and on-line chromatic number of families of graphs,Ars Combinatorica 29C (1990), 168?176.
4. S. Irani: Coloring inductive graphs on-line,Proceedings of the 3lst Annual Symposium on the Foundations of Computer Science, (1990), 470?479.
5. H. A. Kierstead: The linearity of First-Fit for coloring interval graphs,SIAM J. on Discrete Math.,1 (1988), 526?530.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Extending partial colorings of graphs;Discrete Mathematics;2000-05
2. On-Line 3-Chromatic Graphs I. Triangle-Free Graphs;SIAM Journal on Discrete Mathematics;1999-01
3. On-line coloringk-colorable graphs;Israel Journal of Mathematics;1998-12