Showing 161 - 180 results of 2,114 for search '(((pinned OR (pinge OR peng)) OR ((pinge OR peng) OR (spinned OR pinn))) OR (pin OR ling))', query time: 0.20s Refine Results
  1. 161
  2. 162
  3. 163
  4. 164
  5. 165
  6. 166
  7. 167
  8. 168
  9. 169
  10. 170
  11. 171

    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
  12. 172
  13. 173
  14. 174
  15. 175
  16. 176
  17. 177
  18. 178
  19. 179
  20. 180