Author:
Fiala Jiří,Golovach Petr A.,Kratochvíl Jan
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Arnborg, S., Proskurowski, A.: Characterization and recognition of partial k-trees. Congr. Numerantium 47, 69–75 (1985)
2. Bodlaender, H.: Polynomial algorithms for Graph Isomorphism and Chromatic Index on partial k-trees. J. Algorithms 11, 631–643 (1990)
3. Bodlaender, H.: A tourist guide through treewidth. Acta Cybern. 11, 1–21 (1993)
4. Chang, G.J., Kuo, D.: The L(2,1)-labeling problem on graphs. SIAM Journal of Discrete Mathematics 9(2), 309–316 (1996)
5. Courcelle, B.: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs. Inf. Comput. 85(1), 12–75 (1990)
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献