| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9512672 | Discrete Mathematics | 2005 | 6 Pages |
Abstract
We give a short proof for the Mixed Connectivity Certificate Theorem of Even, Itkis and Rajsbaum and provide an upper bound on the edge number of a certificate of local T-mixed connectivity up to k.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
O. Fülöp,