The degree-diameter problem for claw-free graphs and hypergraphs

dc.contributor.author	Dankelmann, Peter
dc.contributor.author	Vetrik, Tomas
dc.date.accessioned	2014-04-01T09:51:53Z
dc.date.issued	2014-02
dc.description.abstract	Please read abstract in the article.	en_US
dc.description.embargo	2015-08-30
dc.description.librarian	hb2014	en_US
dc.description.uri	http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-0118	en_US
dc.identifier.citation	Dankelmann, P & Vetrik, T 2014, 'The degree-diameter problem for claw-free graphs and hypergraphs', Journal of Graph Theory, vol. 75, no. 2, pp. 105-123.	en_US
dc.identifier.issn	0364-9024 (print)
dc.identifier.issn	1097-0118 (online)
dc.identifier.other	10.1002/jgt.21716
dc.identifier.uri	http://hdl.handle.net/2263/37325
dc.language.iso	en	en_US
dc.publisher	Wiley-Blackwell	en_US
dc.rights	© 2013 Wiley Periodicals, Inc.This is the post-peer reviewed version of the following article : Journal of Graph Theory, vol. 75, no. 2, pp.105-123, 2014. doi : 10.1002/jgt.21716 which has been published in final form at : http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-0118	en_US
dc.subject	Claw-free grap	en_US
dc.subject	Hypergraph	en_US
dc.subject	Degree	en_US
dc.subject	Diameter	en_US
dc.subject	Moore geometry	en_US
dc.title	The degree-diameter problem for claw-free graphs and hypergraphs	en_US
dc.type	Postprint Article	en_US