Funder
Research Council of Norway
Grantová Agentura Ceské Republiky
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference15 articles.
1. Bonamy, M., Bousquet, N.: Recoloring graphs via tree decompositions. Eur. J. Comb. 69, 200–213 (2018)
2. Bousquet, N., Heinrich, M.: A polynomial version of Cereceda’s conjecture. arXiv (2019)
3. Bousquet, N., Perarnau, G.: Fast recoloring of sparse graphs. Eur. J. Comb. 52, 1–11 (2016)
4. Cereceda, L.: Mixing graph colourings. PhD thesis, London School of Economics (2007)
5. Dvořák, Z., Feghali, C.: An update on reconfiguring $$10 $$-colorings of planar graphs (2020). arXiv:2002.05383
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献