Showing 221 - 240 results of 4,105 for search '((pina OR (peng OR eng)) OR ((((spinn OR ssspingn) OR pick) OR (spina OR spinal)) OR pin))', query time: 0.23s Refine Results
  1. 221
  2. 222
  3. 223
  4. 224
  5. 225

    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
  6. 226
  7. 227
  8. 228
  9. 229
  10. 230
  11. 231
  12. 232
  13. 233
  14. 234
  15. 235
  16. 236
  17. 237
  18. 238
  19. 239
  20. 240