Facebook Instagram Twitter RSS Feed PodBean Back to top on side

Chromatic numbers of the strong product of odd cycles

In: Mathematica Slovaca, vol. 56, no. 4
Janez Žerovnik
Detaily:
Rok, strany: 2006, 379 - 385
O článku:
The problem of determining the chromatic numbers of the strong product of cycles is considered. A construction is given proving $χ(G)={2p+1}$ for the strong product of $p$ odd cycles of lengths at least $2p+1$. Several consequences are discussed. In particular, it is proved that the strong product of $p$ factors has chromatic number at most $2p+1$ provided that each factor admits a homomorphism to a sufficiently long odd cycle $Cmi$, $mi ≥ {2p +1}$.
Ako citovať:
ISO 690:
Žerovnik, J. 2006. Chromatic numbers of the strong product of odd cycles. In Mathematica Slovaca, vol. 56, no.4, pp. 379-385. 0139-9918.

APA:
Žerovnik, J. (2006). Chromatic numbers of the strong product of odd cycles. Mathematica Slovaca, 56(4), 379-385. 0139-9918.