Strengthening the closure concept in claw-free graphs

Broersma, Hajo and Ryjacek, Zdenek (2001) Strengthening the closure concept in claw-free graphs. Discrete Mathematics, 233 (1-3). pp. 55-63. ISSN 0012-365X

PDF
Restricted to UT campus only: Request a copy
104Kb

Abstract:	We give a strengthening of the closure concept for claw-free graphs introduced by the second author in 1997. The new closure of a claw-free graph G defined here is uniquely determined and preserves the value of the circumference of G. We present an infinite family of graphs with n vertices and 3/2n-1 edges for which the new closure is the complete graph Kn.
Item Type:	Article
Copyright:	© 2001 Elsevier
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Discrete Mathematics and Mathematical Programming (DMMP)
Link to this item:	http://purl.utwente.nl/publications/74523
Official URL:	http://dx.doi.org/10.1016/S0012-365X(00)00226-0
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page

Metis ID: 201548