๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Polyhedral Graphs with Extreme Numbers of Types of Faces

โœ Scribed by Hansjoachim Walther


Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
63 KB
Volume
3
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Highly irregular graphs with extreme num
โœ Zofia Majcher; Jerzy Michael ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 219 KB

A simple connected graph is highly irregular if each of its vertices is adjacent only to vertices with distinct degrees. In this paper we find: (1) the greatest number of edges of a highly irregular graph with n vertices, where n is an odd integer (for n even this number is given in [1]), (2) the sm

On cubic polyhedral graphs with prescrib
โœ Peter Smutnรฝ; Michal Tkรกฤ ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 433 KB

We consider classes of cubic polyhedral graphs whose non-q-gonal faces are adjacent to qgonal faces only. Structural properties of some classes of such graphs are described. For q 5 we show that all the graphs in this class are cyclically 4-edge-connected. Some cyclically 4edge-connected and cyclica

Regular planar graphs with faces of only
โœ P. J. Owens ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 931 KB

We construct a small non-Hamiltonian 3-connected trivalent planar graph whose faces are all 4-gons or 7-gons and show that the shortness coefficient of the class of such graphs is less than one. Then, by transforming non-Hamiltonian trivalent graphs into regular graphs of valency four or five, we ob

Edge-face chromatic number of Halin-grap
โœ Zhongfu Zhang; Xinzhong Lu; Linzhong Liu; Jianfang Wang; Tongxin Gu ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Springer ๐ŸŒ English โš– 50 KB