Konrad Dabrowski, Daniël Paulusma. Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs. In Vangelis Th. Paschos, Peter Widmayer, editors, Algorithms and Complexity - 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings. Volume 9079 of Lecture Notes in Computer Science, pages 167-181, Springer, 2015. [doi]
@inproceedings{DabrowskiP15-0,
title = {Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs},
author = {Konrad Dabrowski and Daniël Paulusma},
year = {2015},
doi = {10.1007/978-3-319-18173-8_12},
url = {http://dx.doi.org/10.1007/978-3-319-18173-8_12},
researchr = {https://researchr.org/publication/DabrowskiP15-0},
cites = {0},
citedby = {0},
pages = {167-181},
booktitle = {Algorithms and Complexity - 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings},
editor = {Vangelis Th. Paschos and Peter Widmayer},
volume = {9079},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-18172-1},
}