Note on $k$-chromatic graphs
Mathematica Bohemica, Tome 119 (1994) no. 1, pp. 43-48
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
MR Zbl
In this paper we characterize $k$-chromatic graphs without isolated vertices and connected $k$-chromatic graphs having a minimal number of edges.
In this paper we characterize $k$-chromatic graphs without isolated vertices and connected $k$-chromatic graphs having a minimal number of edges.
DOI :
10.21136/MB.1994.126206
Classification :
05C15, 05C40
Keywords: chromatic number; connected graph; colouring of a graph; $k$-chromatic graphs; independent set
Keywords: chromatic number; connected graph; colouring of a graph; $k$-chromatic graphs; independent set
Marcu, Dănuţ. Note on $k$-chromatic graphs. Mathematica Bohemica, Tome 119 (1994) no. 1, pp. 43-48. doi: 10.21136/MB.1994.126206
@article{10_21136_MB_1994_126206,
author = {Marcu, D\u{a}nu\c{t}},
title = {Note on $k$-chromatic graphs},
journal = {Mathematica Bohemica},
pages = {43--48},
year = {1994},
volume = {119},
number = {1},
doi = {10.21136/MB.1994.126206},
mrnumber = {1303550},
zbl = {0805.05028},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.21136/MB.1994.126206/}
}
[1] C. Berge: Graphes et Hypergraphes. Dunod, Paris, 1970. | MR | Zbl
[2] N. Christofides: Graph Theory - An Algorithmic Approach. Academic Press, New York, 1975. | MR | Zbl
[3] A. Ershov, G. Kuzhukhin: Estimates of the chromatic number of connected graphs. Dokl. Akad. Nauk. 142, 2 (1962), 270-273. (In Russian.) | MR
Cité par Sources :