Fundamental Cycles and Graph Embeddings
Combinatorics
2015-05-13 v1
Abstract
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.
Keywords
Cite
@article{arxiv.0807.1652,
title = {Fundamental Cycles and Graph Embeddings},
author = {Han Ren and Hongtao Zhao and Haoling Li},
journal= {arXiv preprint arXiv:0807.1652},
year = {2015}
}