Chromatic numbers of strong product of odd cyclesŽerovnik, Janez (Avtor) matematikateorija grafovkrepki produkt grafovkromatično številolih cikelminimalna neodvisna dominantna množicamathematicsgraph theorystrong productchromatic numberodd cycleminimal independent dominating setThe problem of determining the chromatic numbers of the strong product of cycles is considered. A construction is given proving ▫$chi(G) = 2^p + 1$▫ for a product of ▫$p$▫ odd cycles of lengths at least ▫$2^p + 1$▫. Several consequences are discussed. In particular it is proved that the strong product of ▫$p$▫ factors has chromatic number at most ▫$2^p + 1$▫ provided that each factor admits the homomorphism to sufficiently long odd cycle ▫$C_{m_i}, ; m_i ge 2^p + 1$▫.20022015-07-10 14:52:41Delo ni kategorizirano51509UDK: 519.174OceCobissID: 13803097COBISS_ID: 13825113ISSN pri članku: 1571-0653NUK URN: URN:SI:UM:DK:I6EZHDRWsl