Skip to main content
SpringerLink
Log in

Achromatic Number of K 5 × K n for Small n

  • Published:
Czechoslovak Mathematical Journal Aims and scope Submit manuscript

Abstract

The achromatic number of a graph G is the maximum number of colours in a proper vertex colouring of G such that for any two distinct colours there is an edge of G incident with vertices of those two colours. We determine the achromatic number of the Cartesian product of K 5 and K n for all n ≤ 24.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Bouchet: Indice achromatique des graphes multiparti complets et rÈguliers. Cahiers Centre Études Rech. OpÈr. 20 (1978), 331–340.

    MATH  MathSciNet  Google Scholar 

  2. N.P. Chiang and H. L. Fu: On the achromatic number of the Cartesian product G1×G2. Australas. J. Combin. 6 (1992), 111–117.

    MathSciNet  Google Scholar 

  3. N.P. Chiang and H. L. Fu: The achromatic indices of the regular complete multipartite graphs. Discrete Math. 141 (1995), 61–66.

    Article  MathSciNet  Google Scholar 

  4. K. Edwards: The harmonious chromatic number and the achromatic number. In:Surveys in Combinatorics 1997. London Math. Soc. Lect. Notes Series 241 (R. A. Bailey, ed.). Cambridge University Press, 1997, pp. 13–47.

  5. F. Harary, S. Hedetniemi and G. Prins: An interpolation theorem for graphical homomorphisms. Portug. Math. 26 (1967), 454–462.

    MathSciNet  Google Scholar 

  6. M. Hor¬ák and.S P£ola: Achromatic number of K5 × Kn for large n. Discrete Math. 234 (2001), 159–169.

    Article  MathSciNet  Google Scholar 

  7. M. Hor¬ák and J. Puntigán: On the achromatic number of Km × Kn. In: Graphs and Other Combinatorial Topics. Proceedings of the Third Czechoslovak Symposium on Graph Theory, Prague, August 24–27, 1982 (M. Fiedler, ed.). Teubner, Leipzig, 1983, pp. 118–123.

    Google Scholar 

  8. M. Yannakakis and F. Gavril: Edge dominating sets in graphs. SIAM J. Appl. Math. 38 (1980), 364–372.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, P.J. Šafárik University, Jesenná 5, 041 54, Košice, Slovak Republic

    Mirko Horňák

  2. Novitech a. s., Moyzesova 58, 040 01, Košice, Slovak Republic

    Štefan Pčola

Authors
  1. Mirko Horňák
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Štefan Pčola
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Horňák, M., Pčola, Š. Achromatic Number of K 5 × K n for Small n . Czech Math J 53, 963–988 (2003). https://doi.org/10.1023/B:CMAJ.0000024534.51299.08

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:CMAJ.0000024534.51299.08

Search

Navigation