✦ LIBER ✦

A suffcient condition on upper embeddability of graphs

✍ Scribed by JunLiang Cai; GuangHua Dong; YanPei Liu

Publisher: SP Science China Press
Year: 2010
Tongue: English
Weight: 190 KB
Volume: 53
Category: Article
ISSN: 1674-7283
DOI: 10.1007/s11425-009-0169-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A class of upper-embeddable graphs

✍ F. Jaeger; C. Payan; N. H. Xuong 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB

## Abstract In this paper, we prove the following result: Every graph obtained by connecting (with any number of edges) two vertex‐disjoint upper‐embeddable graphs graphs with even Betti number is upper‐embeddable.

Upper embeddability and connectivity of

Upper embeddability and connectivity of graphs

✍ Charles Payan; Nguyen Huy Xuong 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 788 KB

Bidirectional retracting-free double tra

Bidirectional retracting-free double tracings and upper embeddability of graphs

✍ Carsten Thomassen 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 585 KB

A characterization of embeddability of g

A characterization of embeddability of graphs on surfaces

✍ Liu Ying; Liu Yanpei 📂 Article 📅 1998 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 314 KB

On embeddability and stresses of graphs

✍ Eran Nevo 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 155 KB

Theoretical results on at most 1-bend em

Theoretical results on at most 1-bend embeddability of graphs

✍ Yanpei Liu; Paola Marchioro; Rossella Petreschi; Bruno Simeone 📂 Article 📅 1992 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 300 KB