Note on -chromatic graphs
Mathematica Bohemica (1994)
- Volume: 119, Issue: 1, page 43-48
- ISSN: 0862-7959
Access Full Article
topAbstract
topHow to cite
topMarcu, Dănuţ. "Note on $k$-chromatic graphs." Mathematica Bohemica 119.1 (1994): 43-48. <http://eudml.org/doc/29360>.
@article{Marcu1994,
abstract = {In this paper we characterize $k$-chromatic graphs without isolated vertices and connected $k$-chromatic graphs having a minimal number of edges.},
author = {Marcu, Dănuţ},
journal = {Mathematica Bohemica},
keywords = {chromatic number; connected graph; colouring of a graph; $k$-chromatic graphs; independent set; chromatic number; connected graph},
language = {eng},
number = {1},
pages = {43-48},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Note on $k$-chromatic graphs},
url = {http://eudml.org/doc/29360},
volume = {119},
year = {1994},
}
TY - JOUR
AU - Marcu, Dănuţ
TI - Note on $k$-chromatic graphs
JO - Mathematica Bohemica
PY - 1994
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 119
IS - 1
SP - 43
EP - 48
AB - In this paper we characterize $k$-chromatic graphs without isolated vertices and connected $k$-chromatic graphs having a minimal number of edges.
LA - eng
KW - chromatic number; connected graph; colouring of a graph; $k$-chromatic graphs; independent set; chromatic number; connected graph
UR - http://eudml.org/doc/29360
ER -
References
top- C. Berge, Graphes et Hypergraphes, Dunod, Paris, 1970. (1970) Zbl0213.25702MR0357173
- N. Christofides, Graph Theory - An Algorithmic Approach, Academic Press, New York, 1975. (1975) Zbl0321.94011MR0429612
- A. Ershov, G. Kuzhukhin, Estimates of the chromatic number of connected graphs, Dokl. Akad. Nauk. 142, 2 (1962), 270-273. (In Russian.) (1962) MR0140445
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.