Lobsters with an almost perfect matching are graceful

2014/02/17 by Elliot Krop, Krop, Elliot
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #graph theory and CDMA systems #math.CO

paper · pdf · doi:10.48550/arxiv.1402.3994

4 pages

arxiv created 2014/02/17 · openalex publication_date 2014/02/17 · arxiv updated 2014/02/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Let T be a lobster with a matching that covers all but one vertex. We show that in this case, T is graceful.

Citations

• A Dynamic Survey of Graph Labeling

Related

• On certain classes of graceful lobsters
• Graceful and Strongly Graceful Permutations
• On super edge-graceful trees of diameter four
• Antimagic orientation of lobsters
• A complete proof of The Graceful Tree Conjecture using the concept of Edge Degree