Joint-tree model and the maximum genus of graphs

MaRDI QIDQ4913063zbMATH OpenFDO

Authors Guanghua Dong, Ning Wang, Yanpei Liu, Yuanqiu Huang

Publication date 3 April 2013

Full work available at URL https://arxiv.org/abs/1203.0843

zbMATH Keywords

graph embeddingjoint-treemaximum genusSmarandache \(\mathcal P\)-drawing

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35)

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 .

Recommendations

• Genus embeddings of two types of graphs.
• scientific article; zbMATH DE number 3900781
• scientific article; zbMATH DE number 6873977
• scientific article; zbMATH DE number 5823703
• scientific article; zbMATH DE number 5584120

Cited in

(1)

• scientific article; zbMATH DE number 5584120 (Why is no real title available?)

This page was built for publication: Joint-tree model and the maximum genus of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4913063)