✦ LIBER ✦

Graph Packings

✍ Scribed by Pavol Hell

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 224 KB
Volume: 5
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(05)80154-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Clique graphs of packed graphs

✍ Iwao Sato 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 129 KB

Let IGI be the number of vertices of a graph G and to(G) be the density of G. We call a graph G packed if the clique graph K(G) of G has exactly 2 IGI-O'(G) cliques. We correct the characterization of clique graphs of packed graphs given in Theorem 3.2 of Hedman [3]. All graphs considered here are f

Packing bipartite graphs

✍ A. Pawel Wojda; Paul Vaderlind 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 383 KB

For two bipartite graphs G = (L, R; E) and G' = (L', R'; E') a bijection f: LwR --\* L'uR' such that f(L) = L' is called hi-placement when f(u)f(v)~E', for every edge uv ~ E (then G and G' are called hi-placeable). We give new sufficient conditions for bipartite graphs G and G' to be bi-placeable.

Packing smaller graphs into a graph

✍ Jin Akiyama; Fumi Nakada; Sinichi Tokunaga 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 117 KB

Let G be a graph. Given an integer m < IV(G)l, we obtain a lower bound for the largest number of vertex-disjoint subgraphs of G, each of which has m vertices.

Packing Cycles in Graphs

✍ Guoli Ding; Wenan Zang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 267 KB

Random packings of graphs

✍ Lowell W. Beineke; Peter Hamburger; Wayne D. Goddard 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 612 KB

Enumeration of packed graphs

✍ Iwao Sato 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 181 KB