DMCA. Copyrighted Work that you can Claim.
Base have 2315513 titles. Books: 2315513. Articles: 0
Search: 

Preview A sufficient condition for a graph to be weakly k-linked - ScienceDirect pdf file

Volume 36, Issue 1, February 1984, Pages 85-94 ... JOURNAL OF COMBINATORIAL THEORY, Series B 36, 85-94 (1984) A Sufficient Condition for a ... 1. INTRODUCTION A graph is weakly k-linked if for any k vertex pairs (s, , t, ), (SZ, t2),..., (sk, .... The only exception is that not only s,-shuntings but t,-shuntings will be done.



Related links: