Planar graphs without intersecting 5-cycles are signed-4-choosable

A signed graph is a pair (G,σ), where G is a graph and σ : E(G) →{1,−1} is a signature of G. A set S of integers is symmetric if i ∈ S implies that − i ∈ S. Given a list assignment L of G, an L-col...