Upper-embeddability of a graph G^3

MaRDI QIDQ3370453zbMATHFDO

Authors Xiangqun Wu, Han Ren

Publication date 7 February 2006

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Upper embeddability of graphs
• On 2-cell embeddings of graphs with minimum numbers of regions
• scientific article; zbMATH DE number 907923
• A note on the upper embeddability of graphs
• scientific article; zbMATH DE number 5630901

Cited in

(14)

• The maximum genus of graph bundles
• On 2-cell embeddings of graphs with minimum numbers of regions
• scientific article; zbMATH DE number 645859 (Why is no real title available?)
• Face size and the maximum genus of a graph. I: Simple graphs
• Domination number and upper embeddability of a simple graph
• A new effective algorithm for the maximum genus of two types of 3-regular graphs
• The maximum genus of vertex-transitive graphs
• scientific article; zbMATH DE number 3933119 (Why is no real title available?)
• scientific article; zbMATH DE number 2210738 (Why is no real title available?)
• scientific article; zbMATH DE number 4101216 (Why is no real title available?)
• scientific article; zbMATH DE number 846937 (Why is no real title available?)
• scientific article; zbMATH DE number 4156462 (Why is no real title available?)
• scientific article; zbMATH DE number 3900781 (Why is no real title available?)
• $N_2$-locally connected graphs and their upper embeddability

This page was built for publication: Upper-embeddability of a graph \(G^3\)

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