Electronic Resource
Springer
Combinatorica
15 (1995), S. 469-474
ISSN:
1439-6912
Keywords:
05 C 15
;
05 C 35
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract A graphG is said to bek-critical if it has chromatic numberk, but every proper subgraph ofG has a (k−1)-coloring. Gallai asked whether every largek-critical graph contains many (k−1)-critical subgraphs. We provide some information concerning this question and some related questions.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01192519
Permalink
Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |