Acyclic 6-choosability of Planar Graphs without 5-cycles and Adjacent 4-cycles

A proper vertex coloring of a graph is acyclic if every cycle uses at least three colors. A graph G is acyclically k-choosable if for any list assignment L = {L...