𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upper embeddability and connectivity of graphs

✍ Scribed by Charles Payan; Nguyen Huy Xuong

Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
788 KB
Volume
27
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Every connected, locally connected graph
Every connected, locally connected graph is upper embeddable
✍ Ladislav NebeskΓ½ πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 154 KB

## Abstract In this Note it is proved that every connected, locally connected graph is upper embeddable. Moreover, a lower bound for the maximum genus of the square of a connected graph is given.

A class of upper-embeddable graphs
A class of upper-embeddable graphs
✍ F. Jaeger; C. Payan; N. H. Xuong πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 202 KB

## Abstract In this paper, we prove the following result: Every graph obtained by connecting (with any number of edges) two vertex‐disjoint upper‐embeddable graphs graphs with even Betti number is upper‐embeddable.