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

The Maximum Genus of a Graph with Given Diameter and Connectivity

โœ Scribed by Humg-Lin Fu; Ming-Chun Tsai

Book ID
108497952
Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
299 KB
Volume
11
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Graphs of given genus and arbitrarily la
Graphs of given genus and arbitrarily large maximum genus
โœ Richard D. Ringeisen ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 540 KB

Abstrart. The maximum genus of a connected graph (: is the maximum among the genera of a!1 cornpact olientable 2-manifolds upon which G has 2-&l embeddings. In the theorems that fc-llow the use of an edg;:-adding techniq se is combined with ihe well-known Edmonds' technique to prfiruce the desired r

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