Skip to search formSkip to main contentSkip to account menu
You are currently offline. Some features of the site may not work correctly.

Interval edge coloring

Interval edge coloring is a type of edge coloring in which edges are colored such that they form a set of intervals and each color in the interval… Expand
Wikipedia

Papers overview

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
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2013
2013
Abstract. For an undirected, simple, finite, connected graph G, we denote by V(G)and E(G) the sets of its vertices and edges… Expand
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
1993
1993
  • M. Kubale
  • Discret. Math.
  • 1993
  • Corpus ID: 35217082
We consider a problem of interval coloring the vertices of a graph under the stipulation that certain colors cannot be used for… Expand