Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Ma��afiejski, Micha��"'
An edge coloring of a graph G is called interval edge coloring if for each v ��� V(G) the set of colors on edges incident to v forms an interval of integers. A graph G is interval colorable if there is an interval coloring of G. For an interval
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::afe654ff62cfd8ffa919f3c730638fa4
