Showing 261 - 280 results of 1,370 for search '((pinnau OR spingg) OR (((spans OR lingk) OR sspina) OR (ping OR peng)))', query time: 0.19s Refine Results
  1. 261
  2. 262
  3. 263
  4. 264
  5. 265
  6. 266
  7. 267
  8. 268
  9. 269
  10. 270
  11. 271
  12. 272
  13. 273
  14. 274
  15. 275
  16. 276
  17. 277
  18. 278
  19. 279
  20. 280

    On the higher-order edge toughness of a graph by Chen, C.C., Koh, K.M., Peng, Y.H.

    Published 1993
    “…Besides giving the of the cth-order edge toughness τc(G) of a graph G, we prove that 'τc(G)≥k if and only if G has k edge-disjoint spanning forests with exactly c components'. We also study the 'balancity' of a graph G of order p and size q, which is defined as the smallest positive integer c such that τc(G) = p/(p-c). © 1993.…”
    Get full text
    Article