Skip to search formSkip to main contentSkip to account menu

Polyhedral graph

In geometric graph theory, a branch of mathematics, a polyhedral graph is the undirected graph formed from the vertices and edges of a convex… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
We present a preliminary method to generate polyhedral meshes of general non-manifold domains. The method is based on computing… 
2011
2011
We introduce a new combinatorial abstraction for the graphs of polyhedra. The new abstraction is a flexible framework defined by… 
2009
2009
We find the allowed point-group symmetries of the cubic polyhedra with face sizes restricted to 3, 4, 5 and 6. For each group and… 
2009
2009
We introduce a new wider class of polyhedra called upward (star-shaped) polyhedra, and present a graph-theoretic characterization… 
2007
2007
Let G be a 3‐connected planar graph and G* be its dual. We show that the pathwidth of G* is at most 6 times the pathwidth of G… 
2005
2005
The purpose of this article is to introduce a refinement of DeVos-Mohar conjecture in which the number of vertices of polyhedral… 
2002
2002
A k-trestle of a graph G is a 2-connected spanning subgraph of G of maximum degree at most k. We show that a polyhedral graph G… 
Highly Cited
2001
Highly Cited
2001
1994
1994
A novel pair of isospectral nonahedral graphs with eight vertices were found, which not only have the same characteristic… 
1973
1973