Fugang Chao

  • Citations Per Year
Learn More
In this paper we investigate the relation between odd components of co-trees and graph embeddings. We show that any graph G must share one of the following two conditions: (a) for each integer h such that G may be embedded on Sh, the sphere with h handles, there is a spanning tree T in G such that h = 1 2 (β(G)−ω(T )), where β(G) and ω(T ) are,(More)
  • 1