Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

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… 
2012
2012
Giving a planar graph G, let ' ( G) and '' ( G) denote the list edge chromatic number and list total chromatic number of G… 
2005
2004
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… 
Highly Cited
1995
Highly Cited
1995
  • F. 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… 
1992