Filling the complexity gaps for colouring planar and bounded degree graphs (2019)
Attributed to:
Detecting Induced Graph Patterns
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1002/jgt.22459
Publication URI: http://dx.doi.org/10.1002/jgt.22459
Type: Journal Article/Review
Parent Publication: Journal of Graph Theory
Issue: 4