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.

• Type: Journal
• Year: 2005
• Where: ARSCOM
• Authors: Hong-Jian Lai, Deying Li, Jingzhong Mao, Mingquan Zhan
• Keywords: 2-edge-connected Planar Graph, ARSCOM 2005, Planar Graphs, Supereulerian Graph Problems