"Filling the complexity gaps for colouring planar and bounded degree graphs."

Konrad K. Dabrowski et al. (2019)

> Home

Details and statistics

DOI: 10.1002/JGT.22459

access: closed

type: Journal Article

metadata version: 2020-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jgt/DabrowskiD0P19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/DabrowskiD0P19
Konrad K. Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma:
Filling the complexity gaps for colouring planar and bounded degree graphs. J. Graph Theory 92(4): 377-393 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.