Lobsters with an almost perfect matching are graceful

dc.contributor.authorElliot Krop
dc.date.accessioned2024-05-21T13:41:13Z
dc.date.available2024-05-21T13:41:13Z
dc.description.abstractLet $T$ be a lobster with a matching that covers all but one vertex. We show that in this case, $T$ is graceful.
dc.identifier.urihttps://hdl.handle.net/20.500.12951/1012
dc.titleLobsters with an almost perfect matching are graceful
dc.typeJournal Article, Academic Journal
dcterms.bibliographicCitationBulletin of the Institute of Combinatorics and Its Applications 74, 21-24, (May 2015)
Files
Collections