Joint-tree model and the maximum genus of graphs

Details Joint-tree model and the maximum genus of graphs Joint-tree model and the maximum genus of graphs

2012-03-05

arxiv.org/abs/1203.0843v1

Mathematics

Combinatorics

Scientific paper

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 .

Affiliated with

Also associated with

No associations

Rating

Joint-tree model and the maximum genus of graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Joint-tree model and the maximum genus of graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Joint-tree model and the maximum genus of graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-132636