Previous |  Up |  Next


Title: Note on $k$-chromatic graphs (English)
Author: Marcu, Dănuţ
Language: English
Journal: Mathematica Bohemica
ISSN: 0862-7959 (print)
ISSN: 2464-7136 (online)
Volume: 119
Issue: 1
Year: 1994
Pages: 43-48
Summary lang: English
Category: math
Summary: In this paper we characterize $k$-chromatic graphs without isolated vertices and connected $k$-chromatic graphs having a minimal number of edges. (English)
Keyword: chromatic number
Keyword: connected graph
Keyword: colouring of a graph
Keyword: $k$-chromatic graphs
Keyword: independent set
MSC: 05C15
MSC: 05C40
idZBL: Zbl 0805.05028
idMR: MR1303550
DOI: 10.21136/MB.1994.126206
Date available: 2009-09-24T21:02:36Z
Last updated: 2020-07-29
Stable URL:
Reference: [1] C. Berge: Graphes et Hypergraphes.Dunod, Paris, 1970. Zbl 0213.25702, MR 0357173
Reference: [2] N. Christofides: Graph Theory - An Algorithmic Approach.Academic Press, New York, 1975. Zbl 0321.94011, MR 0429612
Reference: [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


Files Size Format View
MathBohem_119-1994-1_4.pdf 897.9Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo