Deciding clique-width for graphs of bounded tree-width.

Espelage, Wolfgang, Gurski, Frank, and Wanke, Egon. "Deciding clique-width for graphs of bounded tree-width.." Journal of Graph Algorithms and Applications 7.2 (2003): 141-180. <http://eudml.org/doc/50437>.

@article{Espelage2003,
author = {Espelage, Wolfgang, Gurski, Frank, Wanke, Egon},
journal = {Journal of Graph Algorithms and Applications},
keywords = {linear time algorithm},
language = {eng},
number = {2},
pages = {141-180},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {Deciding clique-width for graphs of bounded tree-width.},
url = {http://eudml.org/doc/50437},
volume = {7},
year = {2003},
}

TY - JOUR
AU - Espelage, Wolfgang
AU - Gurski, Frank
AU - Wanke, Egon
TI - Deciding clique-width for graphs of bounded tree-width.
JO - Journal of Graph Algorithms and Applications
PY - 2003
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 7
IS - 2
SP - 141
EP - 180
LA - eng
KW - linear time algorithm
UR - http://eudml.org/doc/50437
ER -