Showing 181 - 200 results of 1,490 for search '((pingat OR ((pinged OR pingged) OR (skinned OR pinned))) OR ((pinna OR (sspins OR peng)) OR pin))', query time: 0.18s Refine Results
  1. 181
  2. 182
  3. 183
  4. 184
  5. 185
  6. 186
  7. 187
  8. 188
  9. 189
  10. 190

    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
  11. 191
  12. 192
  13. 193
  14. 194

    PE.210 SCUBA, Fall 2006 by Taylor, Halston W.

    Published 2006
    Subjects:
    Get full text
    Learning Object
  15. 195
  16. 196
  17. 197
  18. 198
  19. 199
  20. 200