Akademska digitalna zbirka SLovenije - logo
(UL)
  • A note on the chromatic number of the square of the Cartesian product of two cycles
    Shao, Zehui ; Vesel, Aleksander
    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_m\Box 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].
    Vir: Discrete mathematics. - ISSN 0012-365X (Vol. 313, iss. 9, 2013, str. 999-1001)
    Vrsta gradiva - članek, sestavni del ; neleposlovje za odrasle
    Leto - 2013
    Jezik - angleški
    COBISS.SI-ID - 19836168

    Povezava(-e):

    http://dx.doi.org/10.1016/j.disc.2013.01.025
    Digitalna knjižnica Univerze v Mariboru – DKUM

vir: Discrete mathematics. - ISSN 0012-365X (Vol. 313, iss. 9, 2013, str. 999-1001)

loading ...
loading ...
loading ...

Vnos na polico