| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

# Show document

Title: A note on the chromatic number of the square of the Cartesian product of two cycles Shao, Zehui (Author)Vesel, Aleksander (Author) http://dx.doi.org/10.1016/j.disc.2013.01.025 English Not categorized (r6) 1.03 - Short Scientific Article FNM - Faculty of Natural Sciences and Mathematics The square ▫$G^2$▫ of a graph ▫$G$▫ is obtained from ▫$G$▫ by adding edges joining all pairs of nodes at distance 2 in ▫$G$▫. In this note we prove that ▫$chi((C_mBox C_n)^2) le 6$ for $m, n ge 40$▫. This confirms Conjecture 19 stated in [É. Sopena, J. Wu, Coloring the square of the Cartesian product of two cycles, Discrete Math. 310 (2010) 2327-2333]. matematika, teorija grafov, kromatično število, kartezični produkt, označevanje grafov, kvadrat grafa, mathematics, graph theory, chromatic number, Cartesian product, graph labeling, square if a graph 2013 str. 999-1001 Vol. 313, iss. 9 519.17 0012-365X 19836168 URN:SI:UM:DK:T9KWT3PM 703 65 Misc.

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

## Record is a part of a journal

Title: Discrete Mathematics Discrete math. North-Holland 0012-365X 1118479

## Secondary language

Language: English O kromatičnem številu kvadrata kartezičnega produkta dveh ciklov