"An Improved Bound on the Minimal Number of Edges in Color-Critical Graphs."

Michael Krivelevich (1998)

> Home

Details and statistics

DOI: 10.37236/1342

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/Krivelevich98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorics/Krivelevich98
Michael Krivelevich:
An Improved Bound on the Minimal Number of Edges in Color-Critical Graphs. Electron. J. Comb. 5 (1998)

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.