Deciding Clique-Width for Graphs of Bounded Tree-Width

Wolfgang Espelage, Frank Gurski, Egon Wanke. Deciding Clique-Width for Graphs of Bounded Tree-Width. J. Graph Algorithms Appl., 7(2):141-180, 2003. [doi]

@article{EspelageGW03,
  title = {Deciding Clique-Width for Graphs of Bounded Tree-Width},
  author = {Wolfgang Espelage and Frank Gurski and Egon Wanke},
  year = {2003},
  url = {http://www.cs.brown.edu/publications/jgaa/accepted/2003/Espelage+2003.7.2.pdf},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/EspelageGW03},
  cites = {0},
  citedby = {0},
  journal = {J. Graph Algorithms Appl.},
  volume = {7},
  number = {2},
  pages = {141-180},
}