Konrad Kazimierz Dabrowski, Daniël Paulusma. Classifying the Clique-Width of H-Free Bipartite Graphs. In Zhipeng Cai, Alex Zelikovsky, Anu G. Bourgeois, editors, Computing and Combinatorics - 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings. Volume 8591 of Lecture Notes in Computer Science, pages 489-500, Springer, 2014. [doi]
@inproceedings{DabrowskiP14, title = {Classifying the Clique-Width of H-Free Bipartite Graphs}, author = {Konrad Kazimierz Dabrowski and Daniël Paulusma}, year = {2014}, doi = {10.1007/978-3-319-08783-2_42}, url = {http://dx.doi.org/10.1007/978-3-319-08783-2_42}, researchr = {https://researchr.org/publication/DabrowskiP14}, cites = {0}, citedby = {0}, pages = {489-500}, booktitle = {Computing and Combinatorics - 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings}, editor = {Zhipeng Cai and Alex Zelikovsky and Anu G. Bourgeois}, volume = {8591}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-319-08782-5}, }