✦ LIBER ✦

Blocks and the nonorientable genus of graphs

✍ Scribed by Saul Stahl; Lowell W. Beineke

Publisher: John Wiley and Sons
Year: 1977
Tongue: English
Weight: 183 KB
Volume: 1
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190010114

No coin nor oath required. For personal study only.

✦ Synopsis

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 that one of the above counterexamples has the minimum possible order.

📜 SIMILAR VOLUMES

Tutte's 5-flow conjecture for graphs of

Tutte's 5-flow conjecture for graphs of nonorientable genus 5

✍ Steffen, Eckhard 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 577 KB

We develop four constructions for nowhere-zero 5-flows of 3-regular graphs that satisfy special structural conditions. Using these constructions we show a minimal counterexample to Tutte's 5-Flow Conjecture is of order 244 and therefore every bridgeless graph of nonorientable genus 5 5 has a nowhere

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 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

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

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.

On the genus of five- and six-regular gr

On the genus of five- and six-regular graphs

✍ Viera Krňanová Proulx 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 1 views

This paper shows how to construct infinitely many regular graphs of degrees five and six having given genus y > 0, which settles favorably Conjecture 1 stated by T. W. Tucker. Tucker has shown that there are infinitely many regular graphs of degrees four and three of arbitrary given genus (Theorem 1