11 citations · 14 across the 2 of their papers we have counts for
2 papers
math.CO2013★ 3 cited
Sum list coloring, the sum choice number, and sc-greedy graphs
Michelle Lastrina, Michael Young
Let G=(V,E) be a graph and let f be a function that assigns list sizes to the vertices of G. It is said that G is f-choosable if for every assignment of lists of colors to the vert…
math.CO2010★ 11 cited
List precoloring extension in planar graphs
Maria Axenovich, Joan P. Hutchinson, Michelle A. Lastrina
A celebrated result of Thomassen states that not only can every planar graph be colored properly with five colors, but no matter how arbitrary palettes of five colors are assigned…