Key points are not available for this paper at this time.
Cuntz and K\"uhne introduced the class of connected subgraph arrangements AG, depending on a graph G, and classified all graphs G such that the corresponding arrangement AG is free. We extend their result to the multiarrangement case and classify all graphs G for which the corresponding arrangement AG supports some multiplicity such that the multiarrangement (AG, ) is free.
Mücksch et al. (Fri,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: