The achromatic number of bounded degree trees
From MaRDI portal
Publication:1584329
Recommendations
Cites work
- scientific article; zbMATH DE number 994578 (Why is no real title available?)
- scientific article; zbMATH DE number 1057876 (Why is no real title available?)
- scientific article; zbMATH DE number 1088659 (Why is no real title available?)
- scientific article; zbMATH DE number 3298599 (Why is no real title available?)
- Complexity Results for Bandwidth Minimization
- The Harmonious Chromatic Number of Bounded Degree Trees
- The complexity of harmonious colouring for 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
- scientific article; zbMATH DE number 3882457 (Why is no real title available?)
- Efficient approximation algorithms for the achromatic number
- scientific article; zbMATH DE number 3906522 (Why is no real title available?)
- 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)