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

Bounds for the genus of graphs with given Betti number

โœ Scribed by Martin Milgram; Peter Ungar

Publisher
Elsevier Science
Year
1977
Tongue
English
Weight
342 KB
Volume
23
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The maximum interval number of graphs wi
The maximum interval number of graphs with given genus
โœ Edward R. Scheinerman ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 202 KB ๐Ÿ‘ 1 views

The interval number of a graph G, denoted i(G), is the least positive integer t such that G is the intersection graph of sets, each of which is the union of t compact real intervals. It is known that every planar graph has interval number at most 3 and that this result is best possible. We investiga

New bounds for the chromatic number of g
New bounds for the chromatic number of graphs
โœ Manouchehr Zaker ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 184 KB ๐Ÿ‘ 1 views

## Abstract In this article we first give an upper bound for the chromatic number of a graph in terms of its degrees. This bound generalizes and modifies the bound given in 11. Next, we obtain an upper bound of the order of magnitude ${\cal O}({n}^{{1}-\epsilon})$ for the coloring number of a graph

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

The number of cutvertices in graphs with
The number of cutvertices in graphs with given minimum degree
โœ L.H. Clark; R.C. Entringer ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 453 KB

The maximum number of cutvertices in a connected graph of order n having minimum degree at least 6 is determined for 6 > 5.