Article
Full entry |
PDF
(0.2 MB)
Feedback
PDF
(0.2 MB)
Feedback
Keywords:
on-line ranking number; complete $n$-partite graph; hereditary and additive properties of graphs
on-line ranking number; complete $n$-partite graph; hereditary and additive properties of graphs
Summary:
References:
[1] B. Bollobás: Extremal Graph Theory. Academic Press, London, 1978. MR 0506522
[2] M. Borowiecki, I. Broere, M. Frick, P. Mihók, and G. Semanišin: Survey of hereditary properties of graphs. Discuss. Math. Graph Theory 17 (1997), 5–50. MR 1633268
[3] J. I. Brown, D. G. Corneil: On generalized graph colourings. J. Graph Theory 11 (1987), 86–99. MR 0876208
[4] E. Bruoth, M. Horňák: On-line ranking number for cycles and paths. Discuss. Math. Graph Theory 19 (1999), 175–197. MR 1768300
[5] E. Bruoth, M. Horňák: A lower bound for on-line ranking number of a path. Discrete Math (to appear). MR 2311106
[6] I. Schiermayer, Zs. Tuza, and M. Voigt: On-line ranking of graphs. Discrete Math. 212 (2000), 141–147. MR 1748681
[7] M. Weaver, D. B. West: Relaxed chromatic numbers of graphs. Graphs Comb. 10 (1994), 75–93. MR 1273014
Search
Partner of
