Paper Info
Title
Polyhedral graphs with extreme numbers of types of faces
Abstract
A face α ∈ F of a polyhedral graph G(V,E,F) is an (a1,a2 ..... al)-face if α is an l-gon and the degrees d(xi) of the vertices xi ∈ V incident with α in the cyclic order are ai, i = 1,2,...,l. The lexicographic minimum 〈b1,b2 ..... bl〉 such that α. is a (b1,b2 ..... bl)-face is the type of α. All polyhedral graphs having only one type of faces are listed. It is proved that the set of triangulations having only faces of different types is non-empty and finite.
Year
DOI
Venue
2002
10.1016/S0166-218X(01)00295-5
Electronic Notes in Discrete Mathematics
Field
DocType
Volume
Discrete mathematics,Combinatorics,Vertex (geometry),Cyclic order,Automorphism,Polyhedral graph,Polyhedron,Cycle graph,Triangulation (social science),Lexicographical order,Mathematics
Journal
120
Issue
ISSN
Citations 
1-3
Electronic Notes in Discrete Mathematics
3
PageRank 
References 
Authors
0.65
0
1
Name
Order
Citations
PageRank
Hansjoachim Walther19720.10