"Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large ..."

Thomas Emden-Weinert, Stefan Hougardy, Bernd Kreuter (1998)

> Home

Details and statistics

DOI: —

access: closed

type: Journal Article

metadata version: 2020-03-12

- view
  - electronic edition @ cambridge.org
- export record
  dblp key:
  - journals/cpc/Emden-WeinertHK98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cpc/Emden-WeinertHK98
Thomas Emden-Weinert, Stefan Hougardy, Bernd Kreuter:
Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth. Comb. Probab. Comput. 7(4): 375-386 (1998)

a service of

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.