✦ LIBER ✦

The genus of the 2-amalgamations of graphs

✍ Scribed by R. W. Decker; H. H. Glover; J. P. Huneke

Publisher: John Wiley and Sons
Year: 1981
Tongue: English
Weight: 319 KB
Volume: 5
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190050107

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Blocks and the nonorientable genus of gr

Blocks and the nonorientable genus of graphs

✍ Saul Stahl; Lowell W. Beineke 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB 👁 1 views

## Abstract Examples are given to show that the nonorientable genus of a graph is not additive over its blocks. A nonorientable analog for the Battle, Harary, Kodama, and Youngs Theorem is proved; this completely determines the nonorientable genus of a graph in terms of its blocks. It is also shown

The Relative Maximum Genus of a Graph

✍ C.P. Bonnington 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 422 KB

On the Spectral Radius and the Genus of

On the Spectral Radius and the Genus of Graphs

✍ H. Yuan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 205 KB

In this paper, we obtain a relation between the spectral radius and the genus of a graph. In particular, we give upper bounds on the spectral radius of graphs with \(n\) vertices and small genus. " " 1995 Academic Press. Ins

Cochromatic Number and the Genus of a Gr

Cochromatic Number and the Genus of a Graph

✍ H. Joseph Straight 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB 👁 1 views

## Abstract The cochromatic number of a graph __G__, denoted by __z__(__G__), is the minimum number of subsets into which the vertex set of __G__ can be partitioned so that each sbuset induces an empty or a complete subgraph of __G__. In this paper we introduce the problem of determining for a surf

On genus imbeddings of the tensor produc

On genus imbeddings of the tensor product of graphs

✍ Abay-Asmerom, Ghidewon 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 566 KB

In this article new genus results for the tensor product H @ G are presented. The second factor G in H @ G is a Cayley graph. The imbedding technique used to establish these results combines surgery and voltage graph theory. This technique was first used by A. T. White [171. This imbedding technique

The Genus Problem for Cubic Graphs

✍ Carsten Thomassen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 206 KB

We prove that the following problem is NP-complete: Given a cubic graph G and a natural number g, is it possible to draw G on the sphere with g handles added?