Sciweavers

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

29

ARSCOM
2005

favoriteEmaildiscussreport

98views more ARSCOM 2005»

Supereulerian planar graphs

13 years 10 months ago

Supereulerian planar graphs

Download www.math.wvu.edu

We investigate the supereulerian graph problems within planar graphs, and we prove that if a 2-edge-connected planar graph G is at most three edges short of having two edge-disjoint spanning trees, then G is supereulerian except a few classes of graphs. This is applied to show the existence of spanning Eulerian subgraphs in planar graphs with small edge cut conditions. We also determine several extremal bounds for planar graphs to be supereulerian.

Hong-Jian Lai, Deying Li, Jingzhong Mao, Mingquan

Real-time Traffic

2-edge-connected Planar Graph | ARSCOM 2005 | Planar Graphs | Supereulerian Graph Problems |

claim paper

Related Content

» Enumerative Properties of Rooted Circuit Maps

» Collapsible biclawfree graphs

» Degree sequence and supereulerian graphs

» Graph Theory

» Convex drawings of hierarchical planar graphs and clustered planar graphs

» Compact ForbiddenSet Routing

» Solving the Replacement Paths Problem for Planar Directed Graphs in Onlog n Time

» An improved bound on the largest induced forests for trianglefree planar graphs

» Finegrained locationfree planarization in wireless sensor networks

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2005
Where	ARSCOM
Authors	Hong-Jian Lai, Deying Li, Jingzhong Mao, Mingquan Zhan

Comments (0)