Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs (2015)
Attributed to:
Detecting Induced Graph Patterns
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.48550/arxiv.1506.06564
Publication URI: https://arxiv.org/abs/1506.06564
Type: Preprint