Author:
Cao Mengyu,Liu Ke,Lu Mei,Lv Zequn
Funder
National Natural Science Foundation of China
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference24 articles.
1. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebr. Discrete Methods,1987
2. On the chromatic number of q-Kneser graphs;Blokhuis;Des. Codes Cryptogr.,2012
3. A tourist guide through treewidth;Bodlaender;Acta Cybernet.,1993
4. A linear-time algorithm for finding tree-decompositions of small treewidth;Bodlaender;SIAM J. Comput.,1996
5. Distance-Regular Graphs;Brouwer,1989