Bounding clique-width via perfect graphs

From MaRDI portal
Publication:2424685

DOI10.1016/j.jcss.2016.06.007zbMath1428.05220arXiv1406.6298OpenAlexW2623827933MaRDI QIDQ2424685

Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma

Publication date: 25 June 2019

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.6298




Related Items (8)



Cites Work


This page was built for publication: Bounding clique-width via perfect graphs