Lobsters with an almost perfect matching are graceful

Abstract

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

4 pages

Cited by in corpus (1)

• Improved Bounds for Relaxed Graceful Trees