A new characterization of P 6 -free graphs (2010)
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.1016/j.dam.2008.08.025
Publication URI: http://dx.doi.org/10.1016/j.dam.2008.08.025
Type: Journal Article/Review
Parent Publication: Discrete Applied Mathematics
Issue: 7