About DML-CZ | FAQ | Conditions of Use | Math Archives | Contact Us
  Previous |  Up |  Next

Article

First Page Preview
Marcu, Dănuţ
Note on $k$-chromatic graphs. (English). Mathematica Bohemica, vol. 119 (1994), issue 1, pp. 43-48
MSC: 05C15, 05C40 | MR 1303550 | Zbl 0805.05028 | DOI: 10.21136/MB.1994.126206
Keywords:
chromatic number; connected graph; colouring of a graph; $k$-chromatic graphs; independent set
Summary:
In this paper we characterize $k$-chromatic graphs without isolated vertices and connected $k$-chromatic graphs having a minimal number of edges.
References:
[1] C. Berge: Graphes et Hypergraphes. Dunod, Paris, 1970. MR 0357173 | Zbl 0213.25702
[2] N. Christofides: Graph Theory - An Algorithmic Approach. Academic Press, New York, 1975. MR 0429612 | Zbl 0321.94011
[3] A. Ershov, G. Kuzhukhin: Estimates of the chromatic number of connected graphs. Dokl. Akad. Nauk. 142, 2 (1962), 270-273. (In Russian.) MR 0140445
Partner of
EuDML logo