Sciweavers

Share
ARSCOM
2005

Supereulerian planar graphs

9 years 11 months ago
Supereulerian planar graphs
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
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)
books