Sciweavers

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

97

Voted

DM
1999

128views more DM 1999»

The maximum number of edges in a graph of bounded dimension, with applications to ring theory

15 years 2 months ago

The maximum number of edges in a graph of bounded dimension, with applications to ring theory

Download www.math.tu-berlin.de

Geir Agnarsson, Stefan Felsner, William T. Trotter

Real-time Traffic

DM 1999 |

claim paper

Related Content

» Counting Plane Graphs Flippability and its Applications

» Bounds on Codes Based on Graph Theory

» Subexponential parameterized algorithms for degreeconstrained subgraph problems on planar ...

» Applications of graph theory to an English rhyming corpus

» Maximum Bipartite Matching Size And Application to Cuckoo Hashing

» Vertex Cover in Graphs with Locally Few Colors

» Edgesplittings preserving local edgeconnectivity of graphs

» A Separator Theorem for Graphs with an Excluded Minor and its Applications

» On the Theory of Pfaffian Orientations II Tjoins kcuts and Duality of Enumeration

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1999
Where	DM
Authors	Geir Agnarsson, Stefan Felsner, William T. Trotter

Comments (0)