Chapter 18 Recursive and on-line graph coloring

Studies in Logic and the Foundations of Mathematics

Volumn 139, Issue C, 1998, Pages 1233-1269

  Kierstead, H A ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77956702360     PISSN: 0049237X     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0049-237X(98)80051-7     Document Type: Article

References (45)

1. Bean D.R. Effective coloration. J. Symbolic Logic 41 (1976) 469-480
2. also in. Brooks R.L. On colouring the nodes of a network. Proc. Cambridge Philos. Soc. 37 (1941) 194-197
3. also in. Brooks R.L. On colouring the nodes of a network. In: Gessel I., and Rota G.-C. (Eds). Classic Papers in Combinatorics (1987), Birkhäuser, Moscow 118-121
4. Chrobak M., and Slusarek M. On some packing problems related to Dynamic Storage Allocation. Rairo Inform. Théor. Appl. 22 (1988) 487-499
5. Ann. Discrete Math. 21. Chvátal V. Perfectly ordered graphs. In: Berge C., and Chvátal V. (Eds). Topics on Perfect Graphs. North-Holland Math. Studies 88 (1984) 63-65
6. Erdös P., and Hajnal A. On chromatic number of graphs and set-systems. Acta Math. Acad. Sci. Hungar. 17 (1966) 61-99
7. Rothchild B. On chromatic number of graphs and set-systems. corr. with. In: Mathais A.R.D., and Rogers H. (Eds). Proc. Cambridge Summer School Math. Logic. Aug. 1-21, 1971. Lecture Notes in Math. 337 (1973) 531-538
8. Gyárfás A. On Ramsey Covering-Numbers. In: Hajnal A., Rado R., and Sós V.T. (Eds). Infinite and Finite Sets, Vol. II, (to P. Erdös on his 60th. birthday, Keszthely, 1973). Coll. Math. Soc. János Bolyai 10 (1975) 801-816
9. (Tanulmányok-mta Számitástech. Automat. Kutató Int., Budapest, 177). Gyárfás A. Problems from the world surrounding perfect graphs. Zasto. Mat. 19 (1985) 413-441
10. Gyárfás A., and Lehel J. On-line and first-fit coloring of graphs. J. Graph Theory 12 (1988) 217-227
11. 5-free graphs. Combinatorica 11 (1991) 181-184
12. Gyárfás A., and Lehel J. First-Fit and on-line chromatic number of families of graphs. In: Siemons J. (Ed). Proc. 12th. British Combinatorial Conf. July 3-7, 1989. Ars Combin. 29 (1990), Univ. E. Anglia, Boston 168-176
13. Gyárfás A., Szemerédi E., and Tuza Zs. Induced subtrees in graphs of large chromatic number. Discrete Math. 30 (1980) 235-244
14. Irani S. Coloring inductive graphs on-line. Foundations of Computer Science, (Proc. 31st. Annual Sympos. Foundations Comput. Sci., St. Louis, MO, Oct. 22-24, 1990), focs-90 (1990), Comput. Soc. Press, Norwich 470-479
15. Irani S. Coloring inductive graphs on-line. Algorithmica 11 (1994) 53-72
16. Kelly D., and Trotter Jr. W.T. Dimension theory for ordered sets. In: Rival I. (Ed). Ordered Sets, (Proc. nato Adv. Study Inst., Banff, Alta, Aug. 28 - Sept. 12, 1981). nato Adv. Study Inst. Ser. C: Math. Phys. Sci. 83 (1982), Reidel, Los Alamitos, CA 171-212
17. Kierstead H.A. An effective version of Dilworth's theorem. Trans. Amer. Math. Soc. 268 (1981) 63-77
18. Kierstead H.A. Recursive colorings of highly recursive graphs. Canad. J. Math. 33 (1981) 1279-1290
19. Kierstead H.A. An effective version of Hall's theorem. Proc. Amer. Math. Soc. 88 (1983) 124-128
20. Kierstead H.A. The linearity of first-fit coloring of interval graphs. siam J. Discrete Math. 1 (1988) 526-530
21. Special issue. Kierstead H.A. A polynomial time approximation algorithm for dynamic storage allocation. In: Aigner M., and Wille R. (Eds). Conbinatorics of Ordered Sets, papers from the 3rd. Oberwolfach Conf. April, 1988. Discrete Math. 88 (1991) 231-237
22. (Jan. 20-26, 1991, Budapest, Hungary). Kierstead H.A. Long stars specify η-bounded classes. In: Halász G., Lovász L., Miklós D., and Szönyi T. (Eds). Sets, Graphs, and Numbers, a birthday salute to V. T. Sós and A. Hajnal. Coll. Math. Soc. János Bolyai 60 (1992) 421-428
23. H. A. Kierstead, On line coloring k-colorable graphs, Israel J. Math., (to appear).
24. Kierstead H.A., McNulty G., and Trotter Jr. W.T. A theory of recursive dimension for ordered sets. Order 1 (1984) 67-82
25. Kierstead H.A., and Penrice S.G. Recent results on a conjecture of Gyárfás. In: Hoffman F., Mullin R.C., Staton R.G., and Reid K.B. (Eds). Proc. 21st. S. E. Conf. Combinatorics, Graph Theory and Computing. Boca Raton, FL, Feb. 12-16, 1990. Congr. Numer. 79 (1990) 182-186
26. Kierstead H.A., and Penrice S.G. Radius two trees specify η-bounded classes. J. Graph Theory 18 (1994) 119-129
27. Kierstead H.A., Penrice S.G., and Trotter Jr. W.T. On-line coloring and recursive graph theory. siam J. Discrete Math. 7 (1994) 72-89
28. 5. siam J. Discrete Math. 8 (1995) 485-498
29. Special issue. Kierstead H.A., and Qin J. Coloring interval graphs with First-Fit. In: Aigner M., and Wille R. (Eds). Combinatorics of Ordered Sets, papers from the 4th. Oberwolfach Conf. 1991. Discrete Math. 144 (1995) 47-57
30. Kierstead H.A., and Trotter Jr. W.T. An extremal problem in recursive combinatorics. Combinatorics, Graph Theory and Computing, Vol. 2, (Proc. 12th. S. E. Conf., Baton Rouge, LA, 1981. Congr. Number. 33 (1981) 143-153
31. (Special issue: to mark the centennial of Julius Petersen's "Die Theorie der regulären graphs", Part 2). Kierstead H.A., and Trotter W.T. Colorful induced subgraphs. Discrete Math. 101 (1992) 165-169
32. Special issue. Lovász L., Saks M., and Trotter Jr. W.T. An on-line graph coloring algorithm with sublinear performance ratio. In: Bollobás B. (Ed). Graph Theory and Combinatorics, Proc. Cambridge Combinatorial Conf. in honour of P. Erdös. Mar. 21-25, 1988. Discrete Math. 75 (1989) 319-325
33. Manaster A.B., and Rosenstein J.G. Effective matchmaking (recursion theoretical aspects of a theorem of Philip Hall. Proc. London Math. Soc., Ser. 3 25 (1972) 615-654
34. Penrice S.G. Techniques for coloring graphs with forbidden trees. Ph.D. Thesis, Arizona State Univ., Tempe, AZ (1991)
35. preprint. Penrice S.G. On-line transitive orientation (1992)
36. J. H. Schmerl, (private communication, 1978).
37. Schmerl J.H. Recursive colorings of graphs. Canad. J. Math. 32 (1980) 821-830
38. Schmerl J.H. The effective version of Brooks' theorem. Canad. J. Math. 34 (1982) 1036-1046
39. L. J. Stockmeyer, (private communication, 1976).
40. Sumner D.P. Subtrees of a graph and the chromatic number. In: Chartrand G. (Ed). The Theory and Applications of Graphs (1981), John Wiley and Sons, Dordrecht and Boston 557-576
41. M. Szegedy, (private communication, 1986).
42. E. Szemerédi and W. T. Trotter Jr., (private communicatio, 1981).
43. Vishwanathan S. Randomized online graph coloring. J. Algorithms 13 (1992) 657-669
44. Woodall D.R. Problem No. 4, Combinatorics. In: McDonough T.P., and Marvon V.C. (Eds). Proc. British Combinatorial Conf. 1973. London Math. Soc. Lecture Note Ser. 13 (1974) 202
45. Yao A.C. Probabilistic Computations: Toward a unified measure of complexity. Foundations of Computer Science, (Proc. 18th. Annual Sympos. Foundations Comput. Sci., Providence, RI, Oct. 31 - Nov. 2, 1977), focs-77 (1977), Comput. Soc. Press, NY 222-227