𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Homogeneous Embeddings of Cycles in Graphs

✍ Scribed by Wayne Goddard; Michael A. Henning; Hiren Maharaj

Publisher
Springer Japan
Year
1999
Tongue
English
Weight
163 KB
Volume
15
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Embedding cycles in IEH graphs
Embedding cycles in IEH graphs
✍ Hung-Yi Chang; Rong-Jaye Chen πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 400 KB

We embed cycles into IEH graphs. First, IEH graphs are proved to be Hamiltonian except when they are of size 2" -1 for all n > 2. Next, we show that for an IEH graph of size N, an arbitrary cycle of even length N, where 3 < Ne < N is found. We also find an arbitrary cycle of odd length NO where 2 <

Least-Distortion Euclidean Embeddings of
Least-Distortion Euclidean Embeddings of Graphs: Products of Cycles and Expanders
✍ Nathan Linial; Avner Magen πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 139 KB

Embeddings of finite metric spaces into Euclidean space have been studied in several contexts: The local theory of Banach spaces, the design of approximation algorithms, and graph theory. The emphasis is usually on embeddings with the least possible distortion. That is, one seeks an embedding that m

Nearly light cycles in embedded graphs a
Nearly light cycles in embedded graphs and crossing-critical graphs
✍ Mario LomelΓ­; Gelasio Salazar πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 101 KB

## Abstract We find a lower bound for the proportion of face boundaries of an embedded graph that are nearly light (that is, they have bounded length and at most one vertex of large degree). As an application, we show that every sufficiently large __k__‐crossing‐critical graph has crossing number a

Embeddings of graphs
Embeddings of graphs
✍ Carsten Thomassen πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 861 KB