Sciweavers

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

38

SIAMDM
2008

favoriteEmaildiscussreport

86views more SIAMDM 2008»

Hamilton Cycles in Planar Locally Finite Graphs

13 years 10 months ago

Hamilton Cycles in Planar Locally Finite Graphs

Download www.math.uni-hamburg.de

A classical theorem by Tutte assures the existence of a Hamilton cycle in every finite 4-connected planar graph. Extensions of this result to infinite graphs require a suitable concept of an infinite cycle. Such a concept was provided by Diestel and K

Henning Bruhn, Xingxing Yu

Real-time Traffic

Classical Theorem | Finite 4-connected Planar | Hamilton Cycle | SIAMDM 2008 |

claim paper

Related Content

» MacLanes planarity criterion for locally finite graphs

» Graph Theory

» Graph Theory with Applications

» On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs

» On the Number of Cycles in Planar Graphs

» On Infinite Cycles I

» The homology of a locally finite graph with ends

» Decomposing Infinite 2Connected Graphs into 3Connected Components

» Chords of longest circuits in locally planar graphs

Post Info
More Details (n/a)

Added	28 Dec 2010
Updated	28 Dec 2010
Type	Journal
Year	2008
Where	SIAMDM
Authors	Henning Bruhn, Xingxing Yu

Comments (0)