Joint-tree model and the maximum genus of graphs
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 M(G - v) = 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 .
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.