𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A class of upper-embeddable graphs

✍ Scribed by F. Jaeger; C. Payan; N. H. Xuong

Publisher
John Wiley and Sons
Year
1979
Tongue
English
Weight
202 KB
Volume
3
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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.

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

Large families of mutually embeddable ve
Large families of mutually embeddable vertex-transitive graphs
✍ Anthony Bonato; Claude Tardif 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB

## Abstract For each infinite cardinal κ, we give examples of 2^κ^ many non‐isomorphic vertex‐transitive graphs of order κ that are pairwise isomorphic to induced subgraphs of each other. We consider examples of graphs with these properties that are also universal, in the sense that they embed all

A class of Hamiltonian regular graphs
A class of Hamiltonian regular graphs
✍ Paul Erdös; Arthur M. Hobbs 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 317 KB

## Abstract In this paper, we show that __n__ ⩾ 4 and if __G__ is a 2‐connected graph with 2__n__ or 2__n__−1 vertices which is regular of degree __n__−2, then __G__ is Hamiltonian if and only if __G__ is not the Petersen graph.

Constructing a Class of Symmetric Graphs
Constructing a Class of Symmetric Graphs
✍ Sanming Zhou 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 208 KB

We find a natural construction of a large class of symmetric graphs from point-and block-transitive 1-designs. The graphs in this class can be characterized as G-symmetric graphs whose vertex sets admit a G-invariant partition B of block size at least 3 such that, for any two blocks B, C of B, eithe

The n-ordered graphs: A new graph class
The n-ordered graphs: A new graph class
✍ Anthony Bonato; Jeannette Janssen; Changping Wang 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB

## Abstract For a positive integer __n__, we introduce the new graph class of __n__‐ordered graphs, which generalize partial __n__‐trees. Several characterizations are given for the finite __n__‐ordered graphs, including one via a combinatorial game. We introduce new countably infinite graphs __R__