Publisher
Springer International Publishing
Reference72 articles.
1. R. Aharoni, E.C. Milner, K. Prikry, Unfriendly partitions of a graph. J. Combin. Theory Ser. B 50(1), 1–10 (1990)
2. Y. Asada, M. Inoue, An efficient silent self-stabilizing algorithm for 1-maximal matching in anonymous networks, in WALCOM: Algorithms and Computation. Lecture Notes in Computer Science, vol. 8973 (2015), pp. 187–198
3. Y. Belhoul, S. Yahiaoui, H. Kheddouci, Efficient self-stabilizing algorithms for minimal total k-dominating sets in graphs. Inform. Process. Lett. 114(7), 339–343 (2014)
4. J.R.S. Blair, S.M. Hedetniemi, S.T. Hedetniemi, D.P. Jacobs, Self-stabilizing maximum matchings. Congr. Numer. 153, 151–159 (2001)
5. A.V. Borodin, A.V. Kostochka, On an upper bound of a graph’s chromatic number, depending on the graph’s degree and density. J. Combin. Theory Ser. B 23, 247–250 (1977)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献