Title of article
Sparse graph certificates for mixed connectivity
Author/Authors
O. Fül?p، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
6
From page
285
To page
290
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 image-mixed connectivity up to image.
Keywords
Greedy forest , Mixed cut , Mixed connectivity certificate , Legal ordering
Journal title
Discrete Mathematics
Serial Year
2005
Journal title
Discrete Mathematics
Record number
948463
Link To Document