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)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Atena PÃ®rvan-Moldovan, Mircea V. Diudea
- 2016

Euler characteristic is a topological invariant, a number that describes the shape or structure of a topological spaceâ€¦Â (More)

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)

Is this relevant?

2011

2011

- Edward D. Kim
- Electronic Notes in Discrete Mathematics
- 2011

We introduce a new combinatorial abstraction for the graphs of polyhedra. The new abstraction is a flexible framework defined byâ€¦Â (More)

Is this relevant?

2008

2008

- Hidetoshi Nonaka
- 2008

This paper presents an interactive modeling system of uniform polyhedra using the isomorphic graphs. Especially, Kepler-Poinsotâ€¦Â (More)

Is this relevant?

2007

2007

- Fedor V. Fomin, Dimitrios M. Thilikos
- Journal of Graph Theory
- 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)

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

- Erhard Hexel
- Discussiones Mathematicae Graph Theory
- 2005

Guaranteed upper bounds on the length of a shortest cycle through k â‰¤ 5 prescribed vertices of a polyhedral graph or planeâ€¦Â (More)

Is this relevant?

2002

2002

- Michal TkÃ¡c, Heinz-JÃ¼rgen Voss
- Discussiones Mathematicae Graph Theory
- 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

- Jochen Harant
- Discrete Mathematics
- 1993

Harant, J., Toughness and nonhamiltonicity of polyhedral graphs, Discrete Mathematics 113 (1993) 249-253. By a theorem of W.Tâ€¦Â (More)

Is this relevant?

1973

1973

- LÃ¡szlÃ³ Babai, Wilfried Imrich
- Discrete Mathematics
- 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?