✦ LIBER ✦

Fundamental cycles and graph embeddings

✍ Scribed by Han Ren; HongTao Zhao; HaoLing Li

Publisher: SP Science China Press
Year: 2009
Tongue: English
Weight: 223 KB
Volume: 52
Category: Article
ISSN: 1674-7283
DOI: 10.1007/s11425-009-0041-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Separating and Nonseparating Disjoint Ho

Separating and Nonseparating Disjoint Homotopic Cycles in Graph Embeddings

✍ Richard Brunet; Bojan Mohar; R.Bruce Richter 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 1023 KB

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 <

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

Homogeneous Embeddings of Cycles in Grap

Homogeneous Embeddings of Cycles in Graphs

✍ Wayne Goddard; Michael A. Henning; Hiren Maharaj 📂 Article 📅 1999 🏛 Springer Japan 🌐 English ⚖ 163 KB

Graph Embeddings and Simplicial Maps

✍ L. S. Heath 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 158 KB

Graph embeddings and Schrödinger equatio

Graph embeddings and Schrödinger equation

✍ Y.Colin de Verdiére 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 67 KB