Semantic Scholar uses AI to extract papers important to this topic.
Abstract. An arbitrary non-empty finite subset of consecutive positive integers is called an interval in graph theory. An edge… Expand Abstract. For an undirected, simple, ﬁnite, connected graph G, we denote by V(G)and E(G) the sets of its vertices and edges… Expand AbstractThe lower bound W(K 2n ) ≥ 3n−2 is proved for the greatest possible numberof colors in an interval edge coloring of the… Expand We consider a problem of interval coloring the vertices of a graph under the stipulation that certain colors cannot be used for… Expand