On the equality of the partial Grundy and upper ochromatic numbers of graphs
type: Item
instance of: scholarly article
title: On the equality of the partial Grundy and upper ochromatic numbers of graphs
zbMATH Open document ID: 1028.05031
DOI: 10.1016/S0012-365X(03)00184-5
author: Stephen T. Hedetniemi
author: Renu C. Laskar
author: Geert C. E. Prins
author: P. Erdős
published in: Discrete Mathematics
publication date: 2003-12-04T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 2012935
zbMATH Keywords: Colorings
zbMATH Keywords: Chromatic number
zbMATH Keywords: Achromatic number
zbMATH Keywords: Grundy number
Wikidata QID: Q105473082
MaRDI profile type: Publication
cites work: Q3277097
cites work: Q3941433
cites work: Q3097395
cites work: Some perfect coloring properties of graphs
cites work: An algorithm for the chromatic number of a graph
cites work: Ordered colourings of graphs
cites work: On the equality of the grundy and ochromatic numbers of a graph
cites work: Q3483299
cites work: Minimum broadcast graphs
cites work: The achromatic number of a graph
cites work: Q5578801
cites work: Q4745272
cites work: Q4243805
cites work: Coloring of trees with minimum sum of colors
cites work: Q4065570
cites work: Q5284013
cites work: Q5670645
cites work: Q3861307
cites work: On Complementary Graphs
cites work: Q3663326
cites work: Q3789586
cites work: Q3347905
cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees
cites work: Tight bounds on the chromatic sum of a connected graph
cites work: Contractions and minimal k-colorability
cites work: An upper bound for the chromatic number of a graph and its application to timetabling problems
full work available at URL: s0012-365x(03)00184-5
OpenAlex ID: W2065534336
description: scientific article; zbMATH DE number 2012935