Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs
Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-29516-9_9
Full Text
Open PDFAbstract
Available in full text
Date
January 1, 2016
Authors
Publisher
Springer International Publishing