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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1973-2017
012319732017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Euler characteristic is a topological invariant, a number that describes the shape or structure of a topological space… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2015
2015
In this paper, we propose a method for realizing a polyhedral graph as a deltahedron, i.e., a polyhedron with congruent… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
We introduce a new combinatorial abstraction for the graphs of polyhedra. The new abstraction is a flexible framework defined by… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2008
2008
This paper presents an interactive modeling system of uniform polyhedra using the isomorphic graphs. Especially, Kepler-Poinsot… (More)
  • table II
  • figure 2
  • figure 3
  • figure 6
  • figure 4
Is this relevant?
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… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2006
2006
The rainbowness, rb(G), of a connected plane graph G is the minimum number k such that any colouring of vertices of the graph G… (More)
Is this relevant?
2005
2005
Guaranteed upper bounds on the length of a shortest cycle through k ≤ 5 prescribed vertices of a polyhedral graph or plane… (More)
  • figure 1
  • table 1
  • figure 2
Is this relevant?
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… (More)
Is this relevant?
1993
1993
Harant, J., Toughness and nonhamiltonicity of polyhedral graphs, Discrete Mathematics 113 (1993) 249-253. By a theorem of W.T… (More)
  • figure 1
  • figure 2
Is this relevant?
1973
1973
It is shown that every group of sense preserving automorphisms of a polyhedral graph is isomorphic to a group of rotations of the… (More)
Is this relevant?