A characterization of supersolvable signed graphs

We characterize supersolvable signed graphs by using simplicial nodes and some signed graphs $\Delta_2, L_k$.

Abh. Math. Sem Univ Hamburg v.25 On rigid circuit graphs G. A. Dirac
Trans. Amer. Math. Soc. v.271 Varieties of combinatorial geometries J. Kahn;J. P. S. Kung
Algebra Universalis v.1 Modular elements of geometric R. P. Stanley
Matroid theory D. J. A. Welsh
Discrete Appl. Math. v.4 Signed graphs T. Zaslavsky
Discrete Appl. Math. v.5 erratum T. Zaslavsky