Showing 141 - 160 results of 918 for search '((anna OR peng) OR (((((sspinn OR sspingn) OR ssspinn) OR pick) OR (spina OR spinae)) OR pin))', query time: 0.19s Refine Results
  1. 141
  2. 142
  3. 143
  4. 144
  5. 145
  6. 146
  7. 147
  8. 148
  9. 149
  10. 150
  11. 151
  12. 152
  13. 153

    On the edge‐toughness of a graph. II by Peng, Y.H., Tay, T.S.

    Published 1993
    “…We also give a simpler proof to the following result of Peng et al.: For any positive integers r, s satisfying r/2 < s ≤ r, there exists an infinite family of graphs such that for each graph G in the family, λ(G) = r (where λ(G) is the edge‐connectivity of G) T1(G) = s, and G can be factored into s spanning trees.…”
    Article
  14. 154
  15. 155
  16. 156
  17. 157
  18. 158
  19. 159
  20. 160