The achromatic number of bounded degree trees
type: Item
instance of: scholarly article
title: The achromatic number of bounded degree trees
zbMATH Open document ID: 0956.05042
DOI: 10.1016/S0012-365X(97)00278-1
author: Niall Cairnie
author: Keith Edwards
published in: Discrete Mathematics
publication date: 2000-11-02T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1524921
zbMATH Keywords: achromatic number
zbMATH Keywords: proper vertex colouring
zbMATH Keywords: polynomial-time algorithm
zbMATH Keywords: tree
MaRDI profile type: Publication
cites work: Q4364806
cites work: The Harmonious Chromatic Number of Bounded Degree Trees
cites work: Q4352945
cites work: The complexity of harmonious colouring for trees
cites work: Complexity Results for Bandwidth Minimization
cites work: Q5578801
cites work: Q3126442
full work available at URL: s0012-365x(97)00278-1
OpenAlex ID: W1970022493
description: scientific article; zbMATH DE number 1524921