Hamiltonicity and colorings of arrangement graphs

Full Text:

PDF

PDF

Buy this Article

Buy this Article

Authors:	Stefan Felsner	Facbereich Mathematik und Informatik, Freie Universität Berlin, Takustr 9, 14195 Berlin, Germany
	Ferran Hurtado	Dept. Mathematica Aplicada 2, Universitat Politecnica de Catalunya, Pau Gargallo 5, Barcelona, Spain
	Marc Noy	Dept. Mathematica Aplicada 2, Universitat Politecnica de Catalunya, Pau Gargallo 5, Barcelona, Spain
	Ileana Streinu	Dept. of Computer Science, Smith College, Northampton, MA

	2000 Article
Bibliometrics
· Downloads (6 Weeks): 1 · Downloads (12 Months): 14 · Downloads (cumulative): 297 · Citation Count: 1

Published in:

· Proceeding

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms

Pages 155-164
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2000
table of contents ISBN:0-89871-453-2

Tools and Resources

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

Share:

|

Tags: algorithms circle and pseudocircle arrangement coloring computations on discrete structures connectivity design general hamilton cycle hamilton decomposition hamilton path line and pseudoline arrangement measurement performance planar graph projective-planar graph theory verification

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:

Windows Media Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder