| Title:
|
Note on graphs colouring (English) |
| Author:
|
Marcu, Dănuţ |
| Language:
|
English |
| Journal:
|
Mathematica Bohemica |
| ISSN:
|
0862-7959 (print) |
| ISSN:
|
2464-7136 (online) |
| Volume:
|
117 |
| Issue:
|
2 |
| Year:
|
1992 |
| Pages:
|
157-158 |
| Summary lang:
|
English |
| . |
| Category:
|
math |
| . |
| Summary:
|
In this paper, we show that the maximal number of minimal colourings of a graph with $n$ vertices and the chromatic number $k$ is equal to $k^{n-k}$, and the single graph for which this bound is attained consists of a $k$-clique and $n-k$ isolated vertices. (English) |
| Keyword:
|
clique |
| Keyword:
|
chromatic number |
| Keyword:
|
isolated vertices |
| Keyword:
|
graph theory |
| Keyword:
|
graph colouring |
| MSC:
|
05C15 |
| MSC:
|
05C40 |
| idZBL:
|
Zbl 0763.05040 |
| idMR:
|
MR1165892 |
| DOI:
|
10.21136/MB.1992.125898 |
| . |
| Date available:
|
2009-09-24T20:51:43Z |
| Last updated:
|
2020-07-29 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/125898 |
| . |
| Reference:
|
[1] C. L. Liu: Introduction to Combinatoгial Mathematics.Mc Graw-Hill Book Co., New York, 1968. MR 0234840 |
| . |
