Efficient approximation algorithms for the achromatic number
From MaRDI portal
Publication:2503345
Recommendations
Cites work
- Achromatic number is NP-complete for cographs and interval graphs
- Advances in graph theory
- Approximating the achromatic number problem on bipartite graphs
- Concerning the achromatic number of graphs
- Edge Dominating Sets in Graphs
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3724488 (Why is no real title available?)
- scientific article; zbMATH DE number 1088659 (Why is no real title available?)
- scientific article; zbMATH DE number 830463 (Why is no real title available?)
- scientific article; zbMATH DE number 1405798 (Why is no real title available?)
- scientific article; zbMATH DE number 6472632 (Why is no real title available?)
- scientific article; zbMATH DE number 3298599 (Why is no real title available?)
- On approximating the achromatic number
- The achromatic number of a graph
- The achromatic number of bounded degree trees
- The Harmonious Chromatic Number of Bounded Degree Trees
Cited in
(7)- The achromatic number of bounded degree trees
- On approximating the achromatic number
- Achromatic number of fragmentable graphs
- scientific article; zbMATH DE number 3906522 (Why is no real title available?)
- scientific article; zbMATH DE number 1405798 (Why is no real title available?)
- An approximation algorithm for the achromatic number of mesh-like topologies
- The achromatic number and the pseudoachromatic number of caterpillars
This page was built for publication: Efficient approximation algorithms for the achromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2503345)