The strongly chordal graph conjecture for graphic arrangements

For a simple graph $G$, let $\mathscr{A}_G$ denote its graphic arrangement. A graph is strongly chordal if it has no induced $n$-sun for $n\geq 3$. An arrangement is flag-accurate when it admits a flag satisfying the required accuracy condition. Strongly chordal flag-accuracy conjecture. If $G$ is a strongly chordal graph, then $\mathscr{A}_G$ is flag-accurate. The conjecture is presented as the graphic counterpart of the open question whether all MAT-free arrangements are flag-accurate; the paper does not report a general resolution.