✦ LIBER ✦

Finding short cycles in embedded graph in polynomial time

✍ Scribed by Han Ren; Ni Cao

Book ID: 107377981
Publisher: Higher Education Press and Springer
Year: 2010
Tongue: English
Weight: 139 KB
Volume: 5
Category: Article
ISSN: 1673-3452
DOI: 10.1007/s11464-010-0003-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Finding short cycles in planar graphs us

Finding short cycles in planar graphs using separators

✍ Dana Richards 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 635 KB

Finding a Maximum Cut of a Planar Graph

Finding a Maximum Cut of a Planar Graph in Polynomial Time

✍ Hadlock, F. 📂 Article 📅 1975 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 459 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 <

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

Packing cycles exactly in polynomial tim

Packing cycles exactly in polynomial time

✍ Qin Chen; Xujin Chen 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 777 KB