A New Characterization of P 6-Free Graphs
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-69733-6_41
Publication URI: http://dx.doi.org/10.1007/978-3-540-69733-6_41
Type: Book Chapter
Book Title: Computing and Combinatorics (2008)
Page Reference: 415-424
ISBN: 978-3-540-69732-9
ISSN: 2731-0450