13 citations · 115 across the 49 of their papers we have counts for
4 papers · 2 filters
Modified Linear Programming and Class 0 Bounds for Graph Pebbling
Daniel W. Cranston, Luke Postle, Chenxiao Xue +1
Given a configuration of pebbles on the vertices of a connected graph , a \emph{pebbling move} removes two pebbles from some vertex and places one pebble on an adjacent vertex.…
Planar Graphs of Girth at least Five are Square -Choosable
Marthe Bonamy, Daniel W. Cranston, Luke Postle
We prove a conjecture of Dvořák, Král, Nejedlý, and Škrekovski that planar graphs of girth at least five are square -colorable for large enough . In fact, we prove the st…
Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
Zdenek Dvorak, Luke Postle
We introduce a new variant of graph coloring called correspondence coloring which generalizes list coloring and allows for reductions previously only possible for ordinary coloring…
Five-list-coloring graphs on surfaces II. A linear bound for critical graphs in a disk
Luke Postle, Robin Thomas
Let be a plane graph with outer cycle and let be a family of sets such that for every . By an -coloring of a subgraph of…