Publisher
Springer International Publishing
Reference30 articles.
1. Aggarwal, G., Fiat, A., Goldberg, A.V., Hartline, J.D., Immorlica, N., Sudan, M.: Derandomization of auctions. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, pp. 619–625. STOC 2005. Association for Computing Machinery, New York, NY, USA, May 2005. https://doi.org/10.1145/1060590.1060682
2. Alon, N., Ben-Eliezer, O., Shangguan, C., Tamo, I.: The hat guessing number of graphs. J. Comb. Theory Ser. B 144, 119–149 (2020). https://doi.org/10.1016/j.jctb.2020.01.003
3. Blair, J.R.S., Peyton, B.: An introduction to chordal graphs and clique trees. In: George, A., Gilbert, J.R., Liu, J.W.H. (eds.) Graph Theory and Sparse Matrix Computation, pp. 1–29. Springer, New York (1993). https://doi.org/10.1007/978-1-4613-8369-7_1
4. Blažej, V., Dvořák, P., Opler, M.: Bears with hats and independence polynomials (2021). https://arxiv.org/abs/2103.07401
5. Bosek, B., Dudek, A., Farnik, M., Grytczuk, J., Mazur, P.: Hat chromatic number of graphs, May 2019. https://arxiv.org/abs/1905.04108
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献