ERA

Download the full-sized PDF of All lobsters with perfect matchings are gracefulDownload the full-sized PDF

Actions

Download  |  Analytics

Export to: EndNote  |  Zotero  |  Mendeley

Communities

This file is in the following communities:

Department of Computing Science

Collections

This file is in the following collections:

Technical Reports

All lobsters with perfect matchings are graceful Open Access

Descriptions

Author or creator
Morgan, David
Additional contributors
Subject/Keyword
Graceful labelling
Perfect matching
Lobster
Type of item
Computing Science Technical Report
Computing science technical report ID
TR05-01
Language
English
Place
Time
Description
Technical report TR05-01. Given a tree T consider one of its longest paths P_T. We define T to be m-distant if all of its vertices are a distance at most m from P_T. We will show that any 3-distant tree satisfying both of the following properties is graceful. The tree has a perfect matching. The tree can be constructed by attaching paths of length two to the vertices of a 1-distant tree (caterpillar); these attachments are made by identifying an end vertex of each path of length two with a vertex of the 1-distant tree.
Date created
2005
License information
Creative Commons Attribution 3.0 Unported
Rights

Citation for previous publication

Source
Link to related item

File Details

Date Uploaded
Date Modified
2014-04-29T16:48:45.927+00:00
Audit Status
Audits have not yet been run on this file.
Characterization
File format: pdf (Portable Document Format)
Mime type: application/pdf
File size: 368944
Last modified: 2015:10:12 17:31:00-06:00
Filename: TR05-01.pdf
Original checksum: 9ecd95f406761ca866460b1fadf273f4
Well formed: true
Valid: true
Page count: 12
Activity of users you follow
User Activity Date