Showing 61 - 80 results of 654 for search '(((pinna OR (spina OR espina)) OR jingle) OR (((spie OR spink) OR sspinn) OR peng))', query time: 0.16s Refine Results
  1. 61
  2. 62
  3. 63
  4. 64
  5. 65
  6. 66
  7. 67
  8. 68
  9. 69
  10. 70
  11. 71
  12. 72
  13. 73

    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. 74
  15. 75
  16. 76
  17. 77
  18. 78
  19. 79
  20. 80