"Tight bounds on the chromatic sum of a connected graph."

Carsten Thomassen et al. (1989)

> Home

Details and statistics

DOI: 10.1002/JGT.3190130310

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/ThomassenEAMS89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/ThomassenEAMS89
Carsten Thomassen, Paul Erdös, Yousef Alavi, Paresh J. Malde, Allen J. Schwenk:
Tight bounds on the chromatic sum of a connected graph. J. Graph Theory 13(3): 353-357 (1989)

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.