Joint-tree model and the maximum genus of graphs
Combinatorics
2012-03-06 v1
Abstract
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 .
Keywords
Cite
@article{arxiv.1203.0843,
title = {Joint-tree model and the maximum genus of graphs},
author = {Guanghua Dong and Ning Wang and Yuanqiu Huang and Yanpei Liu},
journal= {arXiv preprint arXiv:1203.0843},
year = {2012}
}