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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1992-2017
02419922017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Let G be a planar graph with no two 3-cycles sharing an edge. We show that if ∆(G) ≥ 9, then χ′l(G) = ∆(G) and χ ′′ l (G) = ∆(G… (More)
  • figure 1
Is this relevant?
2009
2009
Let G be a plane graph having no 5-cycles with a chord. If either ∆ ≥ 6, or ∆ = 5 and G contains no 4-cycles with a chord or no 6… (More)
  • figure 2
Is this relevant?
2004
2004
We investigate structural properties of planar graphs without triangles or without 4-cycles, and show that every triangle-free… (More)
  • figure 1
Is this relevant?
2002
2002
It is proved that a planar graph G without five cycles is three degenerate, hence, four choosable, and it is also edge-(A( G) + l… (More)
Is this relevant?
2002
2002
Let G be a planar graph without two triangles sharing a common vertex. We prove that (1) G is 4-choosable and (2) G is edge-(∆(G… (More)
Is this relevant?
2001
2001
Let χl (G), χ ′ l (G), χ ′′ l (G), and 1(G) denote, respectively, the list chromatic number, the list chromatic index, the list… (More)
Is this relevant?
1999
1992
1992
Kostochka, A.V., List edge chromatic number of graphs with large girth, Discrete Mathematics 101 (1992) 189-201. It is shown that… (More)
Is this relevant?