Sciweavers

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

31

JCT
2006

favoriteEmaildiscussreport

134views more JCT 2006»

MacLane's planarity criterion for locally finite graphs

13 years 11 months ago

MacLane's planarity criterion for locally finite graphs

Download www.dim.uchile.cl

MacLane's planarity criterion states that a finite graph is planar if and only if its cycle space has a basis B such that every edge is contained in at most two members of B. Solving a problem of Wagner (1970), we show that the topological cycle space introduced recently by Diestel and K

Henning Bruhn, Maya Jakobine Stein

Real-time Traffic

Cycle Space | Finite Graph | JCT 2006 | Planarity Criterion |

claim paper

Related Content

» Hamilton Cycles in Planar Locally Finite Graphs

» Robust Distributed Sensor Network Localization Based on Analysis of Flip Ambiguities

» The Power of Counting Logics on Restricted Classes of Finite Structures

» Map Genus Forbidden Maps and Monadic SecondOrder Logic

» A simple condition implying rapid mixing of singlesite dynamics on spin systems

» Dense and Deformable Motion Segmentation for Wide Baseline Images

» The weakest failure detector for waitfree dining under eventual weak exclusion

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JCT
Authors	Henning Bruhn, Maya Jakobine Stein

Comments (0)