Petros Petrosyan - Profil naukowy - MOST Wiedzy

Wyszukiwarka

Wybrane publikacje

  • Near-interval edge colorings of graphs

    An interval edge coloring of a graph is a proper edge coloring by integers such that the colors on the edges incident with any vertex form an interval of integers. Not all graphs are interval colorable; a simple counterexample is K3. A near-interval coloring is a proper edge coloring of a graph such that the colors on the edges incident with any vertex is either an interval or a near-interval, where the latter is an interval except...

    Pełny tekst do pobrania w serwisie zewnętrznym

wyświetlono 0 razy