Lobsters with an almost perfect matching are graceful
Elliot Krop

TL;DR
This paper proves that lobsters with a near-perfect matching are always graceful, contributing to the understanding of graph labelings in combinatorics.
Contribution
It establishes that lobsters with a matching covering all but one vertex are necessarily graceful, advancing the theory of graph labelings.
Findings
Lobsters with a near-perfect matching are graceful.
The proof confirms the conjecture for this class of graphs.
Enhances understanding of graph labelings in combinatorics.
Abstract
Let be a lobster with a matching that covers all but one vertex. We show that in this case, is graceful.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · graph theory and CDMA systems · Advanced Graph Theory Research
