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

Improved Upper Bounds for ?-Backbone Colorings Along Matchings and Stars

First Author: Broersma H

Attributed to: Exact algorithms for NP-hard problems funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/978-3-540-69507-3_15

Publication URI: http://dx.doi.org/10.1007/978-3-540-69507-3_15

Type: Book Chapter

Book Title: SOFSEM 2007: Theory and Practice of Computer Science (2007)

Page Reference: 188-199

ISBN: 978-3-540-69506-6