The achromatic number of bounded degree trees

DOI10.1016/S0012-365X(97)00278-1zbMATH Open0956.05042OpenAlexW1970022493MaRDI QIDQ1584329FDOQ1584329

Authors: Niall Cairnie, Keith 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

Recommendations

• scientific article; zbMATH DE number 1088659
• scientific article; zbMATH DE number 3882457
• Efficient approximation algorithms for the achromatic number
• scientific article; zbMATH DE number 1405798
• On approximating the achromatic number (preliminary version)

zbMATH Keywords

treepolynomial-time algorithmachromatic numberproper vertex colouring

Mathematics Subject Classification ID

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

Cites Work

• The complexity of harmonious colouring for trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complexity Results for Bandwidth Minimization
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Harmonious Chromatic Number of Bounded Degree Trees

Cited In (10)

• Complete oriented colourings and the oriented achromatic number
• Complete partitions of graphs
• On the achromatic number of the Cartesian product of two complete graphs
• Achromatic number of fragmentable graphs
• On the achromatic number of hypercubes
• Complete colourings of hypergraphs
• Title not available (Why is that?)
• Efficient approximation algorithms for the achromatic number
• Title not available (Why is that?)
• Achromatic number of collections of paths and cycles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584329)