"Sparse Graphs Usually Have Exponentially Many Optimal Colorings."

Michael Krivelevich (2002)

> Home

Details and statistics

DOI: 10.37236/1643

access: closed

type: Journal Article

metadata version: 2022-06-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/combinatorics/Krivelevich02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorics/Krivelevich02
Michael Krivelevich:
Sparse Graphs Usually Have Exponentially Many Optimal Colorings. Electron. J. Comb. 9(1) (2002)

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.