SIGN IN
SIGN UP
Coloring
k
k
-free intersection graphs of geometric objects in the plane
Full Text:
PDF
Buy this Article
Authors:
Jacob Fox
Princeton University, Princeton, NJ, USA
János Pach
City College of New York, New York, NY, USA
Published in:
· Proceeding
SCG '08
Proceedings of the twenty-fourth annual symposium on Computational geometry
ACM
New York, NY
, USA
©2008
table of contents
ISBN: 978-1-60558-071-5
doi>
10.1145/1377676.1377735
2008 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 17
· Citation Count: 4
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SoCG '12
Share:
|
Tags:
algorithms
chromatic number
graph algorithms
intersection graph
quasi-planar
string graph
theory
topological graph
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 Guide to Computing Literature
All Tags
Export Formats
Save to Binder