Fundamental Cycles and Graph Embeddings
classification
🧮 math.CO
keywords
graphfindgenusmaximumalgorithmboundedcharacterizationcommon
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.