Achromatic Number of K 5 × K n for Small n

DOI10.1023/B:CMAJ.0000024534.51299.08zbMath1080.05510OpenAlexW182782269MaRDI QIDQ3366619

Mirko Horňák, Štefan Pčola

Publication date: 14 February 2006

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/30828

zbMATH Keywords

achromatic numberCartesian productcomplete graphcomplete vertex colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

On the achromatic number of the Cartesian product of two complete graphs ⋮ The achromatic number of K_{6} □ K_{7} is 18

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The achromatic indices of the regular complete multipartite graphs
• Edge Dominating Sets in Graphs
• Achromatic number of \(K_5\times K_n\) for large \(n\)

This page was built for publication: Achromatic Number of K 5 × K n for Small n