"An upper bound for the chromatic number of a graph and its application to ..."

D. J. A. Welsh, M. B. Powell (1967)

> Home

Details and statistics

DOI: 10.1093/COMJNL/10.1.85

access: closed

type: Journal Article

metadata version: 2019-06-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cj/WelshP67
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cj/WelshP67
D. J. A. Welsh, M. B. Powell:
An upper bound for the chromatic number of a graph and its application to timetabling problems. Comput. J. 10(1): 85-86 (1967)

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.