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
  • Facial parity edge colouring
    Czap, Július ; Jendrol', Stanislav ; Kardoš, František
    A facial parity edge colouring of a connected bridgeless plane graph is an edge colouring in which no two face-adjacent edges (consecutive edges of a facial walk of some face) receive the same ... colour, in addition, for each face $\alpha$ and each colour $c$, either no edge or an odd number of edges incident with $\alpha$ is coloured with $c$. From Vizing's theorem it follows that every 3-connected plane graph has a such colouring with at most $\Delta^\ast + 1$ colours, where $\Delta^\ast$ is the size of the largest face. In this paper we prove that any connected bridgeless plane graph has a facial parity edge colouring with at most 92 colours.
    Vir: Ars mathematica contemporanea. - ISSN 1855-3966 (Vol. 4, no. 2, 2011, str. 255-268)
    Vrsta gradiva - članek, sestavni del
    Leto - 2011
    Jezik - angleški
    COBISS.SI-ID - 16267097

    Povezava(-e):

    http://amc.imfm.si/index.php/amc/article/view/129
    Digitalna knjižnica Slovenije - dLib.si

vir: Ars mathematica contemporanea. - ISSN 1855-3966 (Vol. 4, no. 2, 2011, str. 255-268)

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

Vnos na polico