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

On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs

First Author: Lozin V

Attributed to: Clique-width of graphs funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/978-3-642-45278-9_27

Publication URI: http://dx.doi.org/10.1007/978-3-642-45278-9_27

Type: Book Chapter

Book Title: Combinatorial Algorithms (2013)

Page Reference: 314-326

ISBN: 978-3-642-45277-2