✦ LIBER ✦

Complexity of graph embeddability problems

✍ Scribed by C. Benzaken; S. Foldes

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 890 KB
Volume: 15
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(81)90085-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Expected complexity of graph partitionin

Expected complexity of graph partitioning problems

✍ Luděk Kučera 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 927 KB

The complexity of some graph colouring p

The complexity of some graph colouring problems

✍ Keith Edwards 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 896 KB

On the complexity of graph tree partitio

On the complexity of graph tree partition problems

✍ Roberto Cordone; Francesco Maffioli 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 270 KB

This paper concerns the optimal partition of a graph into p connected clusters of vertices, with various constraints on their topology and weight. We consider di erent objectives, depending on the cost of the trees spanning the clusters. This rich family of problems mainly applies to telecommunicati

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

Up-embeddability of graphs with small or

Up-embeddability of graphs with small order

✍ Shengxiang Lv; Yanpei Liu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 528 KB

Let G be a 2-edge connected simple graph with girth g and minimal degree δ ≥ 3. If one of the following conditions is satisfied: Here, M(δ, g) is the Moore bound of the (δ, g)-cage. As a corollary, there exists a constant c such that when δ > r |V (G)|-6 c + 1 (r = g-1 2), G is up-embeddable.