📣 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.

Bounding the Clique-Width of H-free Chordal Graphs

First Author: Brandstädt A

Attributed to: Detecting Induced Graph Patterns funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/978-3-662-48054-0_12

Publication URI: http://dx.doi.org/10.1007/978-3-662-48054-0_12

Type: Book Chapter

Book Title: Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II (2015)

Page Reference: 139-150

ISBN: 978-3-662-48053-3

ISSN: 2731-5525