Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,423,177 papers from all fields of science
Search
Sign In
Create Free Account
List edge-coloring
Known as:
List edge colorability
, List coloring conjecture
, List edge coloring
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Dinitz conjecture
Edge coloring
Graph theory
List coloring
Expand
Broader (1)
Graph coloring
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
The list-chromatic index of K 8 and K 10
Landon Rabern
2014
Corpus ID: 4667092
In [4], Cariolaro et al. demonstrated how colorability problems can be approached numerically by the use of computer algebra…
Expand
2013
2013
Edge-choosability of Planar Graphs
Hediyeh Mashhadi Avaz Tehrani
2013
Corpus ID: 123660175
According to the List Colouring Conjecture, if G is a multigraph then χ(G) = χ ′ l(G). In this thesis, we discuss a relaxed…
Expand
2012
2012
Edge choosability and total choosability of toroidal graphs without intersecting triangles
Rui Li
,
Baogang Xu
Ars Comb.
2012
Corpus ID: 33992188
2012
2012
Few Long Lists for Edge Choosability of Planar Cubic Graphs
Luis A. Goddyn
,
A. Spencer
2012
Corpus ID: 118113451
It is known that every loopless cubic graph is 4-edge choosable. We prove the following strengthened result. Let G be a planar…
Expand
2010
2010
Edge-choosability of cubic graphs and the polynomial method
A. Spencer
2010
Corpus ID: 117014059
A graph is k-edge-choosable if for any assignment of a list of at least k colours to each edge, there is a proper edge-colouring…
Expand
2007
2007
The Edge Choosability of Cn x Pm
Guoping Wang
,
Qiongxiang Huang
Ars Comb.
2007
Corpus ID: 29659479
2006
2006
Colorings and Orientations of Matrices and Graphs
U. Schauz
Electronic Journal of Combinatorics
2006
Corpus ID: 601014
We introduce colorings and orientations of matrices as generalizations of the graph theoretic terms. The permanent per$(A[\zeta…
Expand
2006
2006
Some results on a list coloring conjecture of Reed
Xu Yang
,
Z. Xiao
2006
Corpus ID: 123868085
We construct graphs with of available colors for each vertex,such that the size of every list is at least the maximum…
Expand
2005
2005
Edge-choosability of planar graphs with no adjacent triangles
D. Cranston
2005
Corpus ID: 14863157
We show that if G is a planar graph with no two 3-faces sharing an edge and with ∆(G) 6= 5, then G is (∆(G) + 1)-edge-choosable…
Expand
1999
1999
On the list chromatic index of nearly bipartite multigraphs
M. Plantholt
,
S. Tipnis
The Australasian Journal of Combinatorics
1999
Corpus ID: 12501020
Galvin ([7]) proved that every k-edge-colorable bipartite multigraph is kedge-choosable. Slivnik ([11]) gave a streamlined proof…
Expand