VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • Revisiting semistrong edge-coloring of graphs
    Lužar, Borut ; Mockovčiaková, Martina ; Soták, Roman
    A matching M in a graph G is semistrong if every edge of M has an endvertex of degree one in the subgraph induced by the vertices of M. A semistrong edge-coloring of a graph is a proper edge-coloring ... in which every color class induces a semistrong matching. In this paper, we continue investigation of properties of semistrong edge-colorings initiated by Gyárfás and Hubenko. We establish tight upper bounds for general graphs and for graphs with maximum degree 3. We also present bounds about semistrong edge-coloring which follow from results regarding other, at first sight nonrelated, problems. We conclude the paper with several open problems.
    Vir: Journal of graph theory. - ISSN 0364-9024 (Vol. 105, iss. 4, 2024, str. 612-632)
    Vrsta gradiva - članek, sestavni del
    Leto - 2024
    Jezik - angleški
    COBISS.SI-ID - 183431171
    DOI

vir: Journal of graph theory. - ISSN 0364-9024 (Vol. 105, iss. 4, 2024, str. 612-632)
loading ...
loading ...
loading ...