VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • Choosability of the square of a planar graph with maximum degree four [Elektronski vir]
    Cranston, Daniel W. ; Erman, Rok ; Škrekovski, Riste
    We study squares of planar graphs with the aim to determine their list chromatic number. We present new upper bounds for the square of a planar graph with maximum degree ▫$\Delta\leq 4$▫. In ... particular ▫$G^2$▫ is 5-, 6-, 7-, 8-choosable if the girth of ▫$G$▫ is at least 16, 11, 9, 7, respectively. In fact we prove more general results, in terms of maximum average degree, that imply the results above.
    Vir: The Australasian journal of combinatorics [Elektronski vir]. - ISSN 2202-3518 (Vol. 59, 2014, str. 86-97)
    Vrsta gradiva - e-članek
    Leto - 2014
    Jezik - angleški
    COBISS.SI-ID - 17400153

    Povezava(-e):

    http://ajc.maths.uq.edu.au/pdf/59/ajc_v59_p086.pdf

Vnos na polico