Colour-critical graphs with few edges
type: Item
instance of: scholarly article
title: Colour-critical graphs with few edges
zbMATH Open document ID: 0955.05042
DOI: 10.1016/S0012-365X(98)00100-9
published in: Discrete Mathematics
publication date: 2000-11-02T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1524999
zbMATH Keywords: chromatic number
zbMATH Keywords: \(k\)-critical graph
author: Alexandr Kostochka
author: Michael Stiebitz
MaRDI profile type: Publication
cites work: Q5782525
cites work: A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
cites work: The number of edges in critical graphs.
cites work: Q5732334
cites work: Q5520564
cites work: The colour theorems of Brooks and Gallai extended
cites work: An improved bound on the minimal number of edges in color-critical graphs
cites work: On the minimal number of edges in color-critical graphs
Recommended article: On the minimal number of edges in color-critical graphs
Recommended article: Q5477816
Recommended article: Color-critical graphs and hypergraphs with few edges and no short cycles
Recommended article: Q3699708
Recommended article: On color critical graphs
Recommended article: Q3822189
Recommended article: Color critical hypergraphs with many edges
Recommended article: On the number of edges in colour-critical graphs and hypergraphs
Recommended article: Q3495386
Recommended article: An improved bound on the minimal number of edges in color-critical graphs
description: scientific article; zbMATH DE number 1524999