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

7-critical graphs of bounded genus

โœ Scribed by Bojan Mohar

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
186 KB
Volume
112
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A separator theorem for graphs of bounde
A separator theorem for graphs of bounded genus
โœ John R Gilbert; Joan P Hutchinson; Robert Endre Tarjan ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 899 KB
Bounds for the average genus of the vert
Bounds for the average genus of the vertex-amalgamation of graphs
โœ Saul Stahl ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 628 KB

The average orientable genus of graphs has been the subject of a considerable number of recent investigations. It is the purpose of this article to examine the extent to which the average genus of the amalgamation of graphs fails to be additive over its constituent subgraphs. This discrepancy is bou

Upper Bounds of the Spectral Radius of G
Upper Bounds of the Spectral Radius of Graphs in Terms of Genus
โœ Hong Yuan ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 149 KB

Let G be a simple graph with n vertices and orientable genus g and non-orientable genus h. Let \(G) be the spectral radius of the adjacency matrix A of G. We obtain the following sharp bounds of \(G): (1) \(G) 1+-3n+12g&8; (2) \(G) 1+-3n+6h&8.

A tight lower bound on the maximum genus
A tight lower bound on the maximum genus of a simplicial graph
โœ Jianer Chen; Saroja P. Kanchi; Jonathan L. Gross ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 856 KB

It is proved that every connected simplicial graph with minimum valence at least three has maximum genus at least one-quarter of its cycle rank. This follows from the technical result that every 3-regular simplicial graph except K4 has a Xuong co-tree whose odd components have only one edge each. It