Recommendations
Cites work
- Achromatic number of \(K_5\times K_n\) for large \(n\)
- Edge Dominating Sets in Graphs
- scientific article; zbMATH DE number 166081 (Why is no real title available?)
- scientific article; zbMATH DE number 3627213 (Why is no real title available?)
- scientific article; zbMATH DE number 1057876 (Why is no real title available?)
- scientific article; zbMATH DE number 3298599 (Why is no real title available?)
- The achromatic indices of the regular complete multipartite graphs
Cited in
(11)- \(K_{5}(7,3) \leqslant 100\).
- scientific article; zbMATH DE number 3843777 (Why is no real title available?)
- scientific article; zbMATH DE number 166081 (Why is no real title available?)
- scientific article; zbMATH DE number 1409196 (Why is no real title available?)
- The achromatic number of \(K_6\square K_7\) is 18
- Achromatic numbers of Kneser graphs
- The achromatic number of Kneser graphs
- Achromatic number of \(K_5\times K_n\) for large \(n\)
- On the achromatic number of the Cartesian product of two complete graphs
- The achromatic number of the Cartesian product of K₆ and K_q
- The achromatic number of K₆ K_q equals 2q+3 if q41 is odd
This page was built for publication: Achromatic Number of K 5 × K n for Small n
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3366619)
