Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-19T01:42:08.309Z Has data issue: false hasContentIssue false

Inequalities involving the genus of a graph and its thicknesses†

Published online by Cambridge University Press:  18 May 2009

Lowell W. Beineke
Affiliation:
University of Michigan Ann Arbor, Michigan, U.S.A.
Frank Harary
Affiliation:
University of Michigan Ann Arbor, Michigan, U.S.A.
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let G be a graph with p points and q lines, and genus γ. The thicknesst(G) has been introduced as the minimum number of planar subgraphs whose union is G. This topological invariant of a graph has been studied by Battle, Harary and Kodama [1], Tutte [7], Beineke, Harary and Moon [3], and Beineke and Harary [2].

It is natural to generalise this concept of the thickness of a graph to the union of graphs with a specified genus. We say that the n-thickness of G is the minimum number of subgraphs of genus at most n whose union is G. Denoting the n-thickness of G by tn, we write in particular t0 the 0-thickness, i.e., the thickness.

Information

Type
Research Article
Copyright
Copyright © Glasgow Mathematical Journal Trust 1965