✦ LIBER ✦

Upper-embeddable graphs and related topics

✍ Scribed by Nguyen Huy Xuong

Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 366 KB
Volume: 26
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(79)90059-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper embeddability and connectivity of

Upper embeddability and connectivity of graphs

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

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.

Interval graphs and related topics

✍ Martin Charles Golumbic 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 643 KB

Every connected, locally connected graph

Every connected, locally connected graph is upper embeddable

✍ Ladislav Nebeský 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB

## Abstract In this Note it is proved that every connected, locally connected graph is upper embeddable. Moreover, a lower bound for the maximum genus of the square of a connected graph is given.

Bidirectional retracting-free double tra

Bidirectional retracting-free double tracings and upper embeddability of graphs

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

Upper domination and upper irredundance

Upper domination and upper irredundance perfect graphs

✍ Gregory Gutin; Vadim E. Zverovich 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 534 KB

Let /~(G), F(G) and IR(G) be the independence number, the upper domination number and the upper irredundance number, respectively. A graph G is called In this paper, we present a characterization of F-perfect graphs in terms of a family of forbidden induced subgraphs, and show that the class of F-p