Akademska digitalna zbirka SLovenije - logo
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 coloring of outerplane graphs
    Czap, Július
    A facial parity edge coloring of a 2-edge-connected plane graph is such an edge coloring in which no two face-adjacent edges (consecutive edges of a facial walk of some face) receive the same color, ... in addition, for each face ▫$f$▫ and each color ▫$c$▫, either no edge or an odd number of edges incident with ▫$f$▫ is colored with ▫$c$▫. It is known that any 2-edge-connected plane graph has a facial parity edge coloring with at most 92 colors. In this paper we prove that any 2-edge-connected outerplane graph has a facial parity edge coloring with at most 15 colors. If a 2-edge-connected outerplane graph does not contain any inner edge, then 10 colors are sufficient. Moreover, this bound is tight.
    Vir: Ars mathematica contemporanea. - ISSN 1855-3966 (Vol. 5, no. 2, 2012, str. 289-293)
    Vrsta gradiva - članek, sestavni del
    Leto - 2012
    Jezik - angleški
    COBISS.SI-ID - 16276825

vir: Ars mathematica contemporanea. - ISSN 1855-3966 (Vol. 5, no. 2, 2012, str. 289-293)

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