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

List edge-coloring

Known as: List edge colorability, List coloring conjecture, List edge coloring 
In mathematics, list edge-coloring is a type of graph coloring that combines list coloring and edge coloring.An instance of a list edge-coloring… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
A proper edge coloring of a graph is said to be acyclic if any cycle is colored with at least three colors. An edge-list L of a… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We study the problem of reconfiguring one list edge-coloring of a graph into another list edge-coloring by changing only one edge… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
Let G be a planar graph with maximum degree @D(G). We use @g"l^'(G) and @g"l^''(G) to denote the list edge chromatic number and… Expand
  • figure 1
Is this relevant?
2003
2003
Assume that each edge e of a graph G is assigned a list (set) L(e) of colors. Then an edge-coloring of G is called an L-edge… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
2002
Abstract It is proved that a planar graph G without five cycles is three degenerate, hence, four choosable, and it is also edge… Expand
Is this relevant?
2001
2001
A launching rope for use in a continuous casting installation particularly for steel is transferred, before the start of casting… Expand
Is this relevant?
1999
1999
Abstract A multigraph is line-perfect if its line graph is perfect. We prove that if every edge e of a line-perfect multigraph G… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
This paper exploits the remarkable new method of Galvin (J. Combin. Theory Ser. B63(1995), 153?158), who proved that the list… Expand
Is this relevant?
Highly Cited
1995
Highly Cited
1995
  • Fred Galvin
  • J. Comb. Theory, Ser. B
  • 1995
  • Corpus ID: 34556175
Abstract For a bipartite multigraph, the list chromatic index is equal to the chromatic index (which is, of course, the same as… Expand
Is this relevant?
1992
1992
Abstract It is shown that the list edge chromatic number of any graph with maximal degree Δ and girth at least 8‡(ln ‡ + 1.1) is… Expand
Is this relevant?