×

Une caractérisation des graphes K-chromatiques minimaux sans sommet isole. (French) Zbl 0239.05116

MSC:

05C15 Coloring of graphs and hypergraphs
05C35 Extremal problems in graph theory
PDFBibTeX XMLCite
Full Text: DOI EuDML

References:

[1] 1. C. BERGE, Graphes et hypergraphes, Dunod, Paris, 1970. Zbl0213.25702 MR357173 · Zbl 0213.25702
[2] 2. A. ERSHOV et G. KUZHUKHIN, < Estimates of the chromatic number of connected graphs >, Dokl. Akad. Nauk, 142, 2, 1962, p.270-273. Zbl0113.38802 MR140445 · Zbl 0113.38802
[3] 3. I. TOMESCU, Le nombre des graphes connexes k-chromatiques minimaux aux sommets étiquetés, C.R. Acad. Sc. Paris, A, 273, 1971, p. 1124-1126. Zbl0223.05115 MR291027 · Zbl 0223.05115
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.