default search action

combined dblp search
author search
venue search
publication search

ask others

"New upper bounds for the chromatic number of a graph."

Ladislav Stacho (2001)

> Home

Details and statistics

DOI: 10.1002/1097-0118(200102)36:2<117::AID-JGT6>3.0.CO;2-7

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/Stacho01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/Stacho01
Ladislav Stacho:
New upper bounds for the chromatic number of a graph. J. Graph Theory 36(2): 117-120 (2001)

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.