This web page contains the abstract of my paper:

"Universal Caterpillars" with F.R.K. Chung and R.L. Graham, Journal of Combinatorial Theory Series B, 31(1981), p. 348-355.

Abstract: For a class C of graphs, denote by u(C) the least value of m so that for some graph U on m vertices, every G contained in C occurs as a subgraph of U. In this note we obtain rather sharp bounds on u(C) when C is the class of caterpillars on n vertices, i.e., tree with property that the vertices of degree exceeding one induce a path.

**
[
IBM Research home page |
James B. Shearer's home page |
Up
]
**

**
[
IBM home page |
Order |
Search |
Contact IBM |
Help |
(C) |
(TM)
]
**