Fundamental Cycles and Graph Embeddings

Details Fundamental Cycles and Graph Embeddings Fundamental Cycles and Graph Embeddings

2008-07-10

arxiv.org/abs/0807.1652v1

Mathematics

Combinatorics

Scientific paper

In this paper we present a new Good Characterization of maximum genus of a
graph which makes a common generalization of the works of Xuong, Liu, and Fu et
al. Based on this, we find a new polynomially bounded algorithm to find the
maximum genus of a graph.

Affiliated with

Also associated with

No associations

Rating

Fundamental Cycles and Graph Embeddings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fundamental Cycles and Graph Embeddings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fundamental Cycles and Graph Embeddings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-459655