Showing 321 - 340 results of 5,578 for search '((spie OR line) OR (pina OR (peng OR (eng OR (shing OR owing)))))', query time: 0.18s Refine Results
  1. 321
  2. 322
  3. 323
  4. 324
  5. 325
  6. 326
  7. 327
  8. 328
  9. 329
  10. 330
  11. 331
  12. 332
  13. 333
  14. 334
  15. 335
  16. 336
  17. 337
  18. 338
  19. 339

    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
  20. 340