%0 Journal Article
%T Joint-tree model and the maximum genus of graphs
%A Guanghua Dong
%A Ning Wang
%A Yuanqiu Huang
%A Yanpei Liu
%J Mathematics
%D 2012
%I arXiv
%X The vertex v of a graph G is called a 1-critical-vertex for the maximum genus of the graph, or for simplicity called 1-critical-vertex, if G-v is a connected graph and {\deg}M(G - v) = {\deg}M(G) - 1. In this paper, through the joint-tree model, we obtained some types of 1-critical-vertex, and get the upper embeddability of the Spiral Snm .
%U http://arxiv.org/abs/1203.0843v1