📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs

First Author: Dabrowski K

Attributed to: Algorithmic Aspects of Graph Coloring funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/978-3-319-18173-8_12

Publication URI: http://dx.doi.org/10.1007/978-3-319-18173-8_12

Type: Book Chapter

Book Title: Algorithms and Complexity - 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings (2015)

Page Reference: 167-181

ISBN: 978-3-319-18172-1