✦ LIBER ✦

The Relative Maximum Genus of a Graph

✍ Scribed by C.P. Bonnington

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 422 KB
Volume: 60
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1994.1013

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Face Size and the Maximum Genus of a Gra

Face Size and the Maximum Genus of a Graph 1. Simple Graphs

✍ Yuanqiu Huang; Yanpei Liu 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 150 KB

This paper shows that a simple graph which can be cellularly embedded on some closed surface in such a way that the size of each face does not exceed 7 is upper embeddable. This settles one of two conjectures posed by Nedela and S8 koviera (1990, in ``Topics in Combinatorics and Graph Theory,'' pp.

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

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

The genus of the 2-amalgamations of grap

The genus of the 2-amalgamations of graphs

✍ R. W. Decker; H. H. Glover; J. P. Huneke 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 319 KB 👁 1 views

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

Maximum-weight-window problem of a plana

Maximum-weight-window problem of a planar graph

✍ Kazuaki Yamaguchi; Ken Kotani; Sumio Masuda; Toshinobu Kashiwabara 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 406 KB 👁 1 views