✦ LIBER ✦

On Short Noncontractible Cycles in Embedded Graphs

✍ Scribed by Hutchinson, Joan P.

Book ID: 118198444
Publisher: Society for Industrial and Applied Mathematics
Year: 1988
Tongue: English
Weight: 1015 KB
Volume: 1
Category: Article
ISSN: 0895-4801
DOI: 10.1137/0401020

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on embedding graphs without short

A note on embedding graphs without short cycles

✍ Agnieszka Görlich; Monika Pilśniak; Mariusz Woźniak; Irmina A. Zioło 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 169 KB

Finding short cycles in embedded graph i

Finding short cycles in embedded graph in polynomial time

✍ Han Ren; Ni Cao 📂 Article 📅 2010 🏛 Higher Education Press and Springer 🌐 English ⚖ 139 KB

Short cycles in directed graphs

✍ V Chvátal; E Szemerédi 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 237 KB

Short cycles in mediate graphs

✍ G. Hahn; D. Sotteau; H. Sun 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 142 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