A characterization of supersolvable signed graphs

  • Published : 1997.10.01

Abstract

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

Keywords

References

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