Sciweavers

ARSCOM
2005
98views more  ARSCOM 2005»
14 years 14 days 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-disjoi...
Hong-Jian Lai, Deying Li, Jingzhong Mao, Mingquan ...