Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

Abstract. An arbitrary non-empty finite subset of consecutive positive integers is called an interval in graph theory. An edge… Expand

Is this relevant?

2013

2013

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

Is this relevant?

2007

2007

AbstractThe lower bound W(K 2n ) ≥ 3n−2 is proved for the greatest possible numberof colors in an interval edge coloring of the… Expand

Is this relevant?

1993

1993

We consider a problem of interval coloring the vertices of a graph under the stipulation that certain colors cannot be used for… Expand

Is this relevant?