NUK - logo
(UL)
  • Kempe equivalence of edge-colorings in subcubic and subquartic graphs
    McDonald, Jessica ; Mohar, Bojan, 1956- ; Scheide, Diego
    It is proved that all 4-edge-colourings of a (sub)cubic graph are Kempe equivalent. This resolves a conjecture of the second author. In fact, it is found that the maximum degree ▫$\Delta = 3$▫ is a ... threshold for Kempe equivalence of ▫$(\Delta + 1)$▫-edge-colourings, as such an equivalence does not hold in general when ▫$\Delta = 4$▫. One extra colour allows a similar result in this latter case however, namely, when ▫$\Delta \le 4$▫ it is shown that all ▫$(\Delta + 2)$▫-edge-colourings are Kempe equivalent.
    Vir: Journal of graph theory. - ISSN 0364-9024 (Vol. 70, iss. 2, 2012, str. 226-239)
    Vrsta gradiva - članek, sestavni del
    Leto - 2012
    Jezik - angleški
    COBISS.SI-ID - 16294745

vir: Journal of graph theory. - ISSN 0364-9024 (Vol. 70, iss. 2, 2012, str. 226-239)

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