On the achromatic number of the Cartesian product of two complete graphs

DOI10.26493/2590-9770.1555.9a6zbMath1527.05069arXiv2207.01023OpenAlexW4323663921MaRDI QIDQ6065316

Mirko Horňák

Publication date: 11 December 2023

Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.01023

zbMATH Keywords

achromatic numberCartesian productfinite projective planecomplete vertex colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Combinatorial structures in finite projective spaces (51E20)

Cites Work

• Achromatic numbers and graph operations
• The achromatic number of bounded degree trees
• The achromatic indices of the regular complete multipartite graphs
• Achromatic Number of K 5 × K n for Small n
• The achromatic number of K_{6} □ K_{7} is 18
• Achromatic number of \(K_5\times K_n\) for large \(n\)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the achromatic number of the Cartesian product of two complete graphs