✦ LIBER ✦

Graphs with small boundary

✍ Scribed by Yoko Hasegawa; Akira Saito

Book ID: 108113734
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 164 KB
Volume: 307
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.09.028

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ramanujan Graphs with Small Girth

✍ Yair Glasner 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 250 KB

Primal graphs with small degrees

✍ Phyllis Z. Chinn; R.Bruce Richter; Miroslaw Truszczynski 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 746 KB

## It has previously been shown that there is a unique set Il of primal graphs such that every graph has an edge-decomposition into non-isomorphic elements of 17 and that the only decomposition of an element of II into non-isomorphic elements of II is the obvious one. Here it is shown that there a

Decomposing large graphs with small grap

Decomposing large graphs with small graphs of high density

✍ Yuster, Raphael 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 146 KB 👁 2 views

It is shown that for every positive integer h, and for every > 0, there are graphs H = (V H , E H ) with at least h vertices and with density at least 0.5with the following property: any graph with minimum degree at least |V G | 2 (1 + o(1)) and |E H | divides |E G |, then G has an H-decomposition.

Skewness of Graphs with Small Cutsets

✍ Graham Farr; Peter Eades 📂 Article 📅 2003 🏛 Springer Japan 🌐 English ⚖ 169 KB

Algorithms for graphs with small octopus

✍ Fedor V. Fomin; Dieter Kratsch; Haiko Müller 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 376 KB

A d-octopus of a graph G = (V; E) is a subgraph T = (W; F) of G such that W is a dominating set of G, and T is the union of d (not necessarily disjoint) shortest paths of G that have one endpoint in common. First, we study the complexity of ÿnding and approximating a d-octopus of a graph. Then we sh

Graphs with small bandwidth and cutwidth

✍ F.R.K. Chung; P.D. Seymour 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 442 KB

We give counter-examples to the following conjecture which arose in the study of small bandwidth graphs. "For a graph G, suppose that IV(G')( < 1 + ci . diameter (G') for any connected subgraph G' of G, and that G does not contain any refinement of the complete binary tree of cz levels. Is it true