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

Electronic Journal of Combinatorics

Volumn 5, Issue 1, 1998, Pages

  Krivelevich, Michael ^a  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 10044275447     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (5)

1. T. Gallai, Kritische Graphen I, Publ. Math. Inst. Hungar. Acad. Sci. 8 (1963), 265-292.
2. T. R. Jensen and B. Toft, Graph coloring problems, Wiley, New York, 1995.
3. M. Krivelevich, On the minimal number of edges in color-critical graphs, Combinatorica, to appear.
4. H. Sachs and M. Stiebitz, Colour-critical graphs with vertices of low valency, Annals of Discrete Math. 41 (1989), 371-396.
5. M. Stiebitz, Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs, Combinatorica 2 (1982), 315-323.