On a lower bound for the connectivity of the independence complex of a graph (2011)
Attributed to:
The Centre for Discrete Mathematics and its Applications (DIMAP)
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1016/j.disc.2011.06.010
Publication URI: http://dx.doi.org/10.1016/j.disc.2011.06.010
Type: Journal Article/Review
Parent Publication: Discrete Mathematics
Issue: 21