An improved bound on the minimal number of edges in color-critical graphs.

Krivelevich, Michael

The Electronic Journal of Combinatorics [electronic only] (1998)

  • Volume: 5, Issue: 1, page Research paper R4, 4 p.-Research paper R4, 4 p.
  • ISSN: 1077-8926

How to cite

top

Krivelevich, Michael. "An improved bound on the minimal number of edges in color-critical graphs.." The Electronic Journal of Combinatorics [electronic only] 5.1 (1998): Research paper R4, 4 p.-Research paper R4, 4 p.. <http://eudml.org/doc/119251>.

@article{Krivelevich1998,
author = {Krivelevich, Michael},
journal = {The Electronic Journal of Combinatorics [electronic only]},
language = {eng},
number = {1},
pages = {Research paper R4, 4 p.-Research paper R4, 4 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {An improved bound on the minimal number of edges in color-critical graphs.},
url = {http://eudml.org/doc/119251},
volume = {5},
year = {1998},
}

TY - JOUR
AU - Krivelevich, Michael
TI - An improved bound on the minimal number of edges in color-critical graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 1998
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 5
IS - 1
SP - Research paper R4, 4 p.
EP - Research paper R4, 4 p.
LA - eng
UR - http://eudml.org/doc/119251
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.