Sciweavers

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

4

JGT
2006

favoriteEmaildiscussreport

28views more JGT 2006»

New upper bounds on the decomposability of planar graphs

13 years 6 months ago

New upper bounds on the decomposability of planar graphs

Download users.uoa.gr

Fedor V. Fomin, Dimitrios M. Thilikos

Real-time Traffic

JGT 2006 |

claim paper

Related Content

» Higher Eigenvalues of Graphs

» Planar Graph Blocking for External Searching

» Planar Graph Isomorphism is in LogSpace

» Metric uniformization and spectral bounds for graphs

» Reachability in K3 3Free Graphs and K5Free Graphs Is in Unambiguous LogSpace

» Ggraphs for the cage problem a new upper bound

» Maximum Flows on Disjoint Paths

» Directed Planar Reachability is in Unambiguous LogSpace

» The Isomorphism Problem for Planar 3Connected Graphs is in Unambiguous Logspace

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JGT
Authors	Fedor V. Fomin, Dimitrios M. Thilikos

Comments (0)