Showing 101 - 120 results of 1,187 for search '((pingat OR (pinged OR spinggged)) OR ((pinka OR (pinn OR peng)) OR pin))', query time: 0.16s Refine Results
  1. 101
  2. 102
  3. 103
  4. 104
  5. 105
  6. 106
  7. 107
  8. 108
  9. 109
  10. 110
  11. 111
  12. 112
  13. 113
  14. 114
  15. 115
  16. 116
  17. 117
  18. 118
  19. 119
  20. 120

    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