Funder
National Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference12 articles.
1. Adaricheva, K., Bozeman, C., Clarke, N.E., Haas, R., Messinger, M.E., Seyffarth, K., Smith, H.: Reconfiguration graphs for dominating sets, Chapter 6. In: Ferrero, D., Hogben, L., Kingan, S.R., Matthews, G.L. (eds.) Research Trends in Graph Theory and Applications. Springer International Publishing (2021). https://doi.org/10.1007/978-3-030-77983-2
2. Baril, J.-L., Vajnovszki, V.: Minimal change list for Lucas strings and some graph theoretic consequences. Theor. Comput. Sci. 346, 189–199 (2005)
3. Bondy, J.A., Murty, U.S.R.: Graph Theory. GTM 244. Springer, Berlin (2008)
4. Brouwer, A., Csorba, P., Schrijver, L.: The number of dominating sets of a finite graph is odd. https://www.win.tue.nl/~aeb/preprints/domin4a.pdf (2009) (preprint)
5. Cavers, M., Seyffarth, K.: Reconfiguring vertex colourings of 2-trees. Ars Math. Contemp. 17(2), 653–698 (2019)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献