Another bound on the chromatic number of a graph
type: Item
instance of: scholarly article
title: Another bound on the chromatic number of a graph
zbMATH Open document ID: 0384.05043
DOI: 10.1016/0012-365X(78)90167-X
author: Paul A. Catlin
published in: Discrete Mathematics
publication date: 1978-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 3596887
MaRDI profile type: Publication
cites work: On an upper bound of the graph's chromatic number, depending on the graph's degree and density
cites work: Q5782525
cites work: A bound on the chromatic number of a graph
cites work: Graph Decompositions Satisfying Extremal Degree Constraints
cites work: Covering the vertex set of a graph with subgraphs of smaller degree
cites work: Q5530470
cites work: On the Genus of Graphs with Lick-White Number k
full work available at URL: 0012-365x(78)90167-x
OpenAlex ID: W1964627887
description: scientific article; zbMATH DE number 3596887