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.
2016
2016
A modified Wiener number was proposed by Graovać and Pisanski. It is based on the full automorphism group of a graph. In this… 
2015
2015
Let G be a simple graph, the vertex-set and edge-set of which are represented by V (G) and E(G) respectively. In this paper, the… 
2015
2015
. In this paper, we propose a method for realizing a polyhedral graph as a deltahedron, i.e., a polyhedron with congruent… 
2014
2014
This paper addresses upper and lower bounds for the cardinality of a maximum vertex-/edge-disjoint cycle packing in a polyhedral… 
2013
2013
The author has recently developed an interactive modeling system of uniform polyhedra including Platonic solids, Archimedean… 
2010
2010
. In this note we show that deciding the existence of a Hamiltonian cycle in a cubic plane graph is equivalent to the problem of… 
2009
2009
We introduce a new wider class of polyhedra called upward (star-shaped) polyhedra, and present a graph-theoretic characterization… 
2009
2009
We investigate the possibility of forming achiral knottings of polyhedral (3-connected) graphs whose minimal embeddings lie in… 
2009
2009
This paper uses combinatorics and group theory to answer questions about the assembly of icosahedral viral shells. Although the… 
1994
1994
A novel pair of isospectral nonahedral graphs with eight vertices were found, which not only have the same characteristic…