✦ LIBER ✦

Surface embeddability of graphs via homology

✍ Scribed by YanPei Liu

Publisher: SP Science China Press
Year: 2010
Tongue: English
Weight: 118 KB
Volume: 53
Category: Article
ISSN: 1674-7283
DOI: 10.1007/s11425-010-4067-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Upper embeddability and connectivity of

Upper embeddability and connectivity of graphs

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

Complexity of graph embeddability proble

Complexity of graph embeddability problems

✍ C. Benzaken; S. Foldes 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 890 KB

Edge colorings of graphs embeddable in a

Edge colorings of graphs embeddable in a surface of low genus

✍ Hugh Hind; Yue Zhao 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 357 KB

In this paper, by using the Discharging Method, we show that any graph with maximum degree A 1>8 that is embeddable in a surface 2~ of characteristic X(Z)>~0 is class one and any graph with maximum degree A>~9 that is embeddable in a surface Z of characteristic X(Z)=-1 is class one. For surfaces of

Linear coloring of graphs embeddable in

Linear coloring of graphs embeddable in a surface of nonnegative characteristic

✍ WeiFan Wang; Chao Li 📂 Article 📅 2009 🏛 SP Science China Press 🌐 English ⚖ 358 KB