Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs
Attributed to:
Detecting Induced Graph Patterns
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/978-3-319-29516-9_9
Publication URI: http://dx.doi.org/10.1007/978-3-319-29516-9_9
Type: Book Chapter
Book Title: Combinatorial Algorithms (2016)
Page Reference: 100-111