Toughness and longest cycles in 2-connected planar graphs

Böhme, T. and Broersma, H.J. and Veldman, H.J. (1996) Toughness and longest cycles in 2-connected planar graphs. Journal of Graph Theory, 23 (3). pp. 257-263. ISSN 0364-9024

Preview

PDF
376Kb

Item Type:	Article
Copyright:	© 1996 Wiley InterScience
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/71260
Official URL:	http://dx.doi.org/10.1002/(SICI)1097-0118(199611)23:3<257::AID-JGT5>3.0.CO;2-R
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page

Metis ID: 140754