Finding one tight cycle

doi:10.1145/1824777.1824781

Finding one tight cycle

Full Text:

PDF

Buy this Article

Authors:	Sergio Cabello	University of Ljubljana, Slovenia and IMFM
	Matt Devos	Simon Fraser University
	Jeff Erickson	University of Illinois at Urbana-Champaign
	Bojan Mohar	Simon Fraser University

	2010 Article Research Refereed
Bibliometrics
· Downloads (6 Weeks): 6 · Downloads (12 Months): 40 · Downloads (cumulative): 210 · Citation Count: 6

Published in:

	· Journal
	ACM Transactions on Algorithms (TALG) TALG Homepage archive
	Volume 6 Issue 4, August 2010 Article No. 61 ACM New York, NY, USA table of contents doi>10.1145/1824777.1824781

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms combinatorial surface graph algorithms noncontractible cycle nonnumerical algorithms and problems nonseparating cycle theory topological graph theory

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder