Note on graphs colouring
Mathematica Bohemica (1992)
- Volume: 117, Issue: 2, page 157-158
- ISSN: 0862-7959
Access Full Article
top
Abstract
topHow to cite
topMarcu, Dănuţ. "Note on graphs colouring." Mathematica Bohemica 117.2 (1992): 157-158. <http://eudml.org/doc/29052>.
@article{Marcu1992,
abstract = {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.},
author = {Marcu, Dănuţ},
journal = {Mathematica Bohemica},
keywords = {clique; chromatic number; isolated vertices; graph theory; graph colouring; clique; chromatic number; isolated vertices},
language = {eng},
number = {2},
pages = {157-158},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Note on graphs colouring},
url = {http://eudml.org/doc/29052},
volume = {117},
year = {1992},
}
TY - JOUR
AU - Marcu, Dănuţ
TI - Note on graphs colouring
JO - Mathematica Bohemica
PY - 1992
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 117
IS - 2
SP - 157
EP - 158
AB - 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.
LA - eng
KW - clique; chromatic number; isolated vertices; graph theory; graph colouring; clique; chromatic number; isolated vertices
UR - http://eudml.org/doc/29052
ER -
References
top- C. L. Liu, Introduction to Combinatoгial Mathematics, Mc Graw-Hill Book Co., New York, 1968. (1968) MR0234840
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.