✦ LIBER ✦

Shortest enclosing walks and cycles in embedded graphs

✍ Scribed by J.Scott Provan

Book ID: 113163422
Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 915 KB
Volume: 30
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(89)90129-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding Shortest Non-Separating and Non-

Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs

✍ Sergio Cabello; Bojan Mohar 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 336 KB

On packing shortest cycles in graphs

✍ Dieter Rautenbach; Friedrich Regen 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 189 KB

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

On Short Noncontractible Cycles in Embed

On Short Noncontractible Cycles in Embedded Graphs

✍ Hutchinson, Joan P. 📂 Article 📅 1988 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 1015 KB

Efficient approximation algorithms for s

Efficient approximation algorithms for shortest cycles in undirected graphs

✍ Andrzej Lingas; Eva-Marta Lundell 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 162 KB

Fundamental cycles and graph embeddings

✍ Han Ren; HongTao Zhao; HaoLing Li 📂 Article 📅 2009 🏛 SP Science China Press 🌐 English ⚖ 223 KB