Back to Search
Start Over
Sparse graph certificates for mixed connectivity
- Source :
-
Discrete Mathematics . May2005, Vol. 294 Issue 3, p285-290. 6p. - Publication Year :
- 2005
-
Abstract
- 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 -mixed connectivity up to . [Copyright &y& Elsevier]
- Subjects :
- *GRAPHIC methods
*EMBEDDING theorems
*GEOMETRICAL drawing
*MATHEMATICS
Subjects
Details
- Language :
- English
- ISSN :
- 0012365X
- Volume :
- 294
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 17790579
- Full Text :
- https://doi.org/10.1016/j.disc.2004.11.011