Crossing Patterns of Segments
Authors:
- János PachJPJános Pach
- József SolymosiJSJózsef Solymosi
- 1 November 2001
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 96 (2) , 316-325
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A Positive Fraction Erdos - Szekeres TheoremDiscrete & Computational Geometry, 1998
- A left-first search algorithm for planar graphsDiscrete & Computational Geometry, 1995
- Intersection Graphs of SegmentsJournal of Combinatorial Theory, Series B, 1994
- String graphs requiring exponential representationsJournal of Combinatorial Theory, Series B, 1991
- String graphs. II. recognizing string graphs is NP-hardJournal of Combinatorial Theory, Series B, 1991
- Not All Graphs are Segment T-graphsEuropean Journal of Combinatorics, 1990
- Upper bounds for configurations and polytopes inR dDiscrete & Computational Geometry, 1986
- Intersection graphs of curves in the planeJournal of Combinatorial Theory, Series B, 1976
- On the Betti numbers of real varietiesProceedings of the American Mathematical Society, 1964
- On a problem of K. ZarankiewiczColloquium Mathematicum, 1954