✦ LIBER ✦

Graph Embeddings and Simplicial Maps

✍ Scribed by L. S. Heath

Publisher: Springer
Year: 1997
Tongue: English
Weight: 158 KB
Volume: 30
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s002240000041

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On simplicial and co-simplicial vertices

On simplicial and co-simplicial vertices in graphs

✍ Chı́nh T Hoàng; Stefan Hougardy; Frédéric Maffray; N.V.R Mahadev 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 286 KB

We investigate the class of graphs deÿned by the property that every induced subgraph has a vertex which is either simplicial (its neighbours form a clique) or co-simplicial (its non-neighbours form an independent set). In particular we give the list of minimal forbidden subgraphs for the subclass o

Graph embeddings and Schrödinger equatio

Graph embeddings and Schrödinger equation

✍ Y.Colin de Verdiére 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 67 KB

Fundamental cycles and graph embeddings

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

Graphs and Balanced Simplicial Complexes

✍ Gábor Hetyei 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 273 KB

Rubber bands, convex embeddings and grap

Rubber bands, convex embeddings and graph connectivity

✍ N. Linial; L. Lovász; A. Wigderson 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 660 KB

A duality theorem for graph embeddings

✍ Brad Jackson; T. D. Parsons; Tomaž Pisanski 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 918 KB

## Abstract A generalized type of graph covering, called a “Wrapped quasicovering” (wqc) is defined. If __K, L__ are graphs dually embedded in an orientable surface __S__, then we may lift these embeddings to embeddings of dual graphs K̃,L̃ in orientable surfaces S̃, such that S̃ are branched cover