The achromatic number of bounded degree trees

DOI10.1016/S0012-365X(97)00278-1zbMath0956.05042OpenAlexW1970022493MaRDI QIDQ1584329

Niall Cairnie, Keith J. Edwards

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00278-1

zbMATH Keywords

treepolynomial-time algorithmachromatic numberproper vertex colouring

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Achromatic number of collections of paths and cycles ⋮ Complete oriented colourings and the oriented achromatic number ⋮ On the achromatic number of the Cartesian product of two complete graphs ⋮ Complete partitions of graphs ⋮ Achromatic number of fragmentable graphs ⋮ Efficient approximation algorithms for the achromatic number ⋮ Complete colourings of hypergraphs ⋮ On the achromatic number of hypercubes

Cites Work

• The complexity of harmonious colouring for trees
• Complexity Results for Bandwidth Minimization
• The Harmonious Chromatic Number of Bounded Degree Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The achromatic number of bounded degree trees