Coloring Graphs On-line
作者： Hal A. Kierstead
DOI: 10.1007/BFB0029574
关键词: Algorithm complexity 、 Cost analysis 、 Graph colouring 、 Mathematics 、 Algorithm 、 Graph theory 、 Chordal graph 、 Line (text file) 、 Interval graph 、 Combinatorics
摘要:
springer.com
elsevier.com
sci-hub.se 参考文章(26)
Marek Chrobak, Maciej Ślusarek, On some packing problem related to dynamic storage allocation Theoretical Informatics and Applications. ,vol. 22, pp. 487- 499 ,(1988) , 10.1051/ITA/1988220404871
András Gyárfás, Problems from the world surrounding perfect graphs Applicationes Mathematicae. ,vol. 19, pp. 413- 441 ,(1987) , 10.4064/AM-19-3-4-413-441
H. A. Kierstead, K. Kolossa, On-line coloring of perfect graphs Combinatorica. ,vol. 16, pp. 479- 491 ,(1996) , 10.1007/BF01271267
H. A. Kierstead, The linearity of first-fit coloring of interval graphs SIAM Journal on Discrete Mathematics. ,vol. 1, pp. 526- 530 ,(1988) , 10.1137/0401048
Henry A. Kierstead, Stephen G. Penrice, William T. Trotter, On-Line and First-Fit Coloring of Graphs That Do Not Induce $P_5$ SIAM Journal on Discrete Mathematics. ,vol. 8, pp. 485- 498 ,(1995) , 10.1137/S0895480191218861
Stefan Felsner, On-line chain partitions of orders Theoretical Computer Science. ,vol. 175, pp. 283- 292 ,(1997) , 10.1016/S0304-3975(96)00204-6
H. A. Kierstead, On-line coloringk-colorable graphs Israel Journal of Mathematics. ,vol. 105, pp. 93- 104 ,(1998) , 10.1007/BF02780324
Henry A. Kierstead, An effective version of Dilworth’s theorem Transactions of the American Mathematical Society. ,vol. 268, pp. 63- 77 ,(1981) , 10.1090/S0002-9947-1981-0628446-X
Henry A. Kierstead, An effective version of Hall’s theorem Proceedings of the American Mathematical Society. ,vol. 88, pp. 124- 128 ,(1983) , 10.1090/S0002-9939-1983-0691291-0
Andr�s Gy�rf�s, Jen? Lehel, Effective on-line coloring of P 5 -free graphs Combinatorica. ,vol. 11, pp. 181- 184 ,(1991) , 10.1007/BF01206361