V. P. Polesskii, “Relationship between Chromatic Number and Branch Connectivity in a Finite Graph”, Probl. Peredachi Inf., 1971, Volume 7, Issue 1,Pages <nobr>105

JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 1971 Volume 7, Issue 1, Pages 105–107 (Mi ppi1628)

Сorrespondence

Relationship between Chromatic Number and Branch Connectivity in a Finite Graph

V. P. Polesskii

Abstract: A new upper bound is established for the chromatic number of an arbitrary finite graph; for a large number of graphs it is better than the Brooks bound.

UDC: 513.83

Received: 11.08.1969

Fulltext: PDF file (302 kB)

English version: Problems of Information Transmission, 1971, 7:1, 85–87

Bibliographic databases: