Lobsters with an almost perfect matching are graceful
classification
🧮 math.CO
keywords
gracefulmatchingalmostcasecoverslobsterlobstersperfect
read the original abstract
Let $T$ be a lobster with a matching that covers all but one vertex. We show that in this case, $T$ is graceful.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.