The subchromatic number of a graph
type: Item
instance of: scholarly article
title: The subchromatic number of a graph
zbMATH Open document ID: 0681.05033
DOI: 10.1016/0012-365X(89)90196-9
author: Robert E. Jamison
author: Stephen T. Hedetniemi
author: Michael O. Albertson
author: S. C. Locke
published in: Discrete Mathematics
publication date: 1989-01-01T00:00:00Z
review text: The subchromatic number of a graph G is the least number of sets in a partition of V(G) such that each set induces a disjoint union of complete graphs. It follows that the subchromatic number of G is a lower bound for the chromatic number. In this paper various properties of subchromatic number are developed. The authors do a good job of relating their work with earlier investigations such as hereditary properties of graphs. The paper closes with a number of interesting open questions.
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 4114664
zbMATH Keywords: complete graph
zbMATH Keywords: subchromatic number
zbMATH Keywords: chromatic number
reviewed by: John Mitchem
MaRDI profile type: Publication
Wikidata QID: Q56428500
cites work: Q3758854
cites work: Q3788046
cites work: Q5422499
cites work: Point partition numbers and generalized Nordhaus-Gaddum problems
cites work: Q3688407
cites work: Q5782525
cites work: On generalized graph colorings
cites work: Q5560916
cites work: The Point-Arboricity of Planar Graphs
cites work: The point-arboricity of a graph
cites work: Colour Classes for r-Graphs
cites work: An interpolation theorem for partitions which are complete with respect to hereditary properties
cites work: Point Partition Numbers and Girth
cites work: Q3760563
cites work: On chromatic number of graphs and set-systems
cites work: Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
cites work: Parallel concepts in graph theory
cites work: Q3220612
cites work: The achromatic number of a graph
cites work: Q5578801
cites work: Q3205260
cites work: On Partitioning Planar Graphs
cites work: Q5668824
cites work: Brève communication. Sur le nombre chromatique $K(p, G)$ des graphes
cites work: Q5552096
cites work: Q5589872
cites work: On Ramsey theory and graphical parameters
cites work: Q4175304
cites work: Q5615946
cites work: k-Degenerate Graphs
cites work: On chromatic number of finite set-systems
cites work: Sur le coloriage des graphs
cites work: Q3689206
cites work: Q5588432
cites work: Q5556302
cites work: Q3859786
cites work: An inequality for the chromatic number of a graph
DBLP publication ID: journals/dm/AlbertsonJHL89
description: scientific article; zbMATH DE number 4114664