Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

21

COMBINATORICS
2006

favoriteEmaildiscussreport

134views more COMBINATORICS 2006»

Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers

13 years 11 months ago

Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers

Download www.math.nyu.edu

János Pach, Dömötör Pá

Real-time Traffic

COMBINATORICS 2006 |

claim paper

Related Content

» BoundedDegree Graphs have Arbitrarily Large Geometric Thickness

» Graph drawings with few slopes

» The Shannon capacity of a graph and the independence numbers of its powers

» Vertex Cover in Graphs with Locally Few Colors

» Clawfree circularperfect graphs

» Mining Frequent Subgraph by Incidence Matrix Normalization

» Overlap properties of geometric expanders

» InNetwork Computation in Random Wireless Networks A PAC Approach to Constant Refresh Rates...

» Nash equilibria in graphical games on trees revisited

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	COMBINATORICS
Authors	János Pach, Dömötör Pálvölgyi

Comments (0)