Login / Signup
Filling the complexity gaps for colouring planar and bounded degree graphs.
Konrad K. Dabrowski
François Dross
Matthew Johnson
Daniël Paulusma
Published in:
J. Graph Theory (2019)
Keyphrases
</>
bounded degree
bounded treewidth
graph theoretic
worst case
graph theory
decision problems
planar graphs
databases
social networks
computational complexity
search space
data management
sufficient conditions
np complete
graph matching
graph databases