Ask a Librarian

Threre are lots of ways to contact a librarian. Choose what works best for you.

HOURS TODAY

10:00 am - 3:00 pm

Reference Desk

CONTACT US BY PHONE

(802) 656-2022

Voice

(802) 503-1703

Text

MAKE AN APPOINTMENT OR EMAIL A QUESTION

Schedule an Appointment

Meet with a librarian or subject specialist for in-depth help.

Email a Librarian

Submit a question for reply by e-mail.

WANT TO TALK TO SOMEONE RIGHT AWAY?

Library Hours for Monday, March 18th

All of the hours for today can be found below. We look forward to seeing you in the library.
HOURS TODAY
8:00 am - 12:00 am
MAIN LIBRARY

SEE ALL LIBRARY HOURS
WITHIN HOWE LIBRARY

MapsM-Th by appointment, email govdocs@uvm.edu

Media Services8:00 am - 7:00 pm

Reference Desk10:00 am - 3:00 pm

OTHER DEPARTMENTS

Special Collections10:00 am - 6:00 pm

Dana Health Sciences Library7:30 am - 11:00 pm

 

CATQuest

Search the UVM Libraries' collections

UVM Theses and Dissertations

Browse by Department
Format:
Print
Author:
Morrison, Sara Alaina
Dept./Program:
Mathematics
Year:
2004
Degree:
M.S.
Abstract:
The goal of this research is to determine the specific conditions under which we can find a simple planar graph G that admits a packing of multiple copies of a tree. This is equivalent to finding a planar graph G which has an edge partition such that each part is isomorphic to the given tree. We begin by looking at paths, stars, and the Ok,k graph, defined as a tree with 2 vertices of degree k and all other vertices of degree 1. We restrict our studies to the tight packing, where the planar graph G is a triangulation. Tight packings occur with six copies of the tree on 2n vertices and three copies of the tree on n + 1 vertices. We also discuss extensions of our results as directions for future studies.