• DOI:10.1007/s00493-018-3830-1
• Corpus ID: 119306831

List Supermodular Coloring with Shorter Lists

@article{Yokoi2017ListSC,
  title={List Supermodular Coloring with Shorter Lists},
  author={Yu Yokoi},
  journal={Combinatorica},
  year={2017},
  volume={39},
  pages={459-475}
}

• Yu Yokoi
• Published 18 July 2017
• Mathematics
• Combinatorica

In 1995, Galvin proved that a bipartite graph G admits a list edge coloring if every edge is assigned a color list of length Δ(G) the maximum degree of the graph. This result was improved by Borodin, Kostochka and Woodall, who proved that G still admits a list edge coloring if every edge e=st is assigned a list of max{dG(s);dG(t)} colors. Recently, Iwata and Yokoi provided the list supermodular coloring theorem that extends Galvin's result to the setting of Schrijver's supermodular coloring. This paper provides a common generalization of these two extensions of Galvin's result.