Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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… Expand

2010

2010

A graph H is defined to be light in a family H of graphs if there exists a finite number @f(H,H) such that each G@?H which… Expand

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… Expand

2005

2005

The purpose of this article is to introduce a refinement of DeVos-Mohar conjecture in which the number of vertices of polyhedral… Expand

2004

2004

Let G = G(V,E,F) be a polyhedral graph with vertex set V, edge set E and face set F. e = (x, y; α, β) ∈ E(G) denotes an edge… Expand

2001

2001

Abstract Extended Abstract By Download : Download full-size image we denote the set of polyhedral graphs, and let G = G(V, E, F… Expand

2000

2000

Abstract It is proved that every 3-connected planar graph G with δ ( G )⩾4 either does not contain any path on k ⩾8 vertices or… Expand

1999

1999

It is proved that each polyhedral graph that contains a vertex of degree at least 52k, contains also a path Pk on k vertices such… Expand

1994

1994

A novel pair of isospectral nonahedral graphs with eight vertices were found, which not only have the same characteristic… Expand

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… Expand