Upper-embeddability of a graph G^3

zbMATH Open1083.05018MaRDI QIDQ3370453FDOQ3370453

Authors: Xiangqun Wu, Han Ren 

Publication date: 7 February 2006

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

Mathematics Subject Classification ID

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

Cited In (14)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The maximum genus of graph bundles
• A new effective algorithm for the maximum genus of two types of 3-regular graphs
• Title not available (Why is that?)
• The maximum genus of vertex-transitive graphs
• On 2-cell embeddings of graphs with minimum numbers of regions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Domination number and upper embeddability of a simple graph
• Title not available (Why is that?)
• $N_2$-locally connected graphs and their upper embeddability
• Face size and the maximum genus of a graph. I: Simple graphs

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)