Narodna in univerzitetna knjižnica, Ljubljana (NUK)
Naročanje gradiva za izposojo na dom
Naročanje gradiva za izposojo v čitalnice
Naročanje kopij člankov
Urnik dostave gradiva z oznako DS v signaturi
  • Graphs with maximum degree 5 are acyclically 7-colorable
    Kostochka, Alexandr V. ; Stocker, C.
    An acyclic coloring is a proper coloring with the additional property that the union of any two color classes induces a forest. We show that every graph with maximum degree at most 5 has an acyclic ... 7-coloring. We also show that every graph with maximum degree at most ▫$r$▫ has an acyclic ▫$\left( 1 + \lfloor \frac{(r + 1)^2}{4} \rfloor \right)$▫-coloring.
    Vir: Ars mathematica contemporanea. - ISSN 1855-3966 (Vol. 4, no. 1, 2011, str. 153-164)
    Vrsta gradiva - članek, sestavni del
    Leto - 2011
    Jezik - angleški
    COBISS.SI-ID - 16266073

vir: Ars mathematica contemporanea. - ISSN 1855-3966 (Vol. 4, no. 1, 2011, str. 153-164)

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