Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference18 articles.
1. Valeur propre minimale du laplacien de Coxeter pour le groupe symétrique;Bacher;J. Algebra,1994
2. Classifying coloring graphs;Beier;Discrete Math.,2016
3. M. Bonamy, M. Johnson, I. Lignos, V. Patel, D. Paulusma, Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs.
4. The complexity of rerouting shortest paths;Bonsma;Theoret. Comput. Sci.,2013
5. Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances;Bonsma;Theoret. Comput. Sci.,2009
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献