Author:
Li Yaqiao,Narayan Vishnu V.,Pankratov Denis
Publisher
Springer International Publishing
Reference14 articles.
1. Albers, S., Schraink, S.: Tight bounds for online coloring of basic graph classes. In: 25th Annual European Symposium on Algorithms (ESA 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)
2. Barabási, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)
3. Bean, D.R.: Effective coloration. J. Symbolic Logic 41(2), 469–480 (1976)
4. Bianchi, M.P., Böckenhauer, H.-J., Hromkovič, J., Keller, L.: Online coloring of bipartite graphs with and without advice. Algorithmica 70(1), 92–111 (2013). https://doi.org/10.1007/s00453-013-9819-7
5. Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209(1), 1–45 (1998)