Funder
Research Council of Norway
Czech Science Foundation
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference6 articles.
1. N. Bousquet, M. Heinrich, A polynomial version of Cereceda's conjecture, arXiv, 2019.
2. Fast recoloring of sparse graphs;Bousquet;Eur. J. Comb.,2016
3. Mixing graph colourings;Cereceda,2007
4. Toward Cereceda's conjecture for planar graphs;Eiben;J. Graph Theory,2020
5. Paths between colourings of sparse graphs;Feghali;Eur. J. Comb.,2019
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献