Author:
Gurski Frank,Rothe Irene,Rothe Jörg,Wanke Egon
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. T. Ito, T. Nishizeki, and X. Zhou. Algorithms for multicolorings of partial k-trees. IEICE Transactions on Information and Systems, E86-D:191–200, 2003.
2. S. Arnborg. Efficient algorithms for combinatorial problems on graphs with bounded decomposability – A survey. BIT, 25:2–23, 1985.
3. D. Rose. On simple characterizations of k-trees. Discrete Mathematics, 7:317–322, 1974.
4. S. Arnborg, D. Corneil, and A. Proskurowski. Complexity of finding embeddings in a .k-tree. SIAM Journal of Algebraic and Discrete Methods, 8(2):277–284, 1987.
5. J. Chlebikova. Partial .k-trees with maximum chromatic number. Discrete Mathematics, 259(1–3):269–276, 2002.