✦ LIBER ✦

Packing of graphs—a survey

✍ Scribed by H.P. Yap

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 630 KB
Volume: 72
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(88)90232-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Near Packing of Two Graphs

✍ Nancy Eaton 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 99 KB

Let G 1 and G 2 be two graphs on n vertices with 2(G 1 )=d 1 and 2(G 2 )=d 2 . A packing of G 1 and G 2 is a set and H 1 and H 2 are edge disjoint subgraphs of K n . B. Bolloba s and S. E. Eldridge (1978, J. Combin. Theory Ser. B 25, 105 124) made the following conjecture. If (d 1 +1) } (d 1 +1) n+

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.

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

Supereulerian graphs: A survey

✍ Paul A. Catlin 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 996 KB

## Abstract A graph is __supereulerian__ if it has a spanning eulerian subgraph. There is a rduction method to determine whether a graph is supereulerian, and it can also be applied to study other concepts, e.g., hamiltonian line graphs, a certain type of double cycle cover, and the total interval

Packing Cycles in Graphs

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

Universal maximal packing functions of g

Universal maximal packing functions of graphs

✍ E.J. Cockayne; O. Favaron; C.M. Mynhardt 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 502 KB

## A packing function N[v] denotes the closed neighbourhood of vertex v). We consider the existence of universal maximal packing functions, i.e. maximal packing functions (MPFs) whose convex combinations with all other MPFs are themselves MPFs.